6,205 research outputs found
Rational minimax approximation via adaptive barycentric representations
Computing rational minimax approximations can be very challenging when there
are singularities on or near the interval of approximation - precisely the case
where rational functions outperform polynomials by a landslide. We show that
far more robust algorithms than previously available can be developed by making
use of rational barycentric representations whose support points are chosen in
an adaptive fashion as the approximant is computed. Three variants of this
barycentric strategy are all shown to be powerful: (1) a classical Remez
algorithm, (2) a "AAA-Lawson" method of iteratively reweighted least-squares,
and (3) a differential correction algorithm. Our preferred combination,
implemented in the Chebfun MINIMAX code, is to use (2) in an initial phase and
then switch to (1) for generically quadratic convergence. By such methods we
can calculate approximations up to type (80, 80) of on in
standard 16-digit floating point arithmetic, a problem for which Varga, Ruttan,
and Carpenter required 200-digit extended precision.Comment: 29 pages, 11 figure
An Algorithmic Framework for Efficient Large-Scale Circuit Simulation Using Exponential Integrators
We propose an efficient algorithmic framework for time domain circuit
simulation using exponential integrator. This work addresses several critical
issues exposed by previous matrix exponential based circuit simulation
research, and makes it capable of simulating stiff nonlinear circuit system at
a large scale. In this framework, the system's nonlinearity is treated with
exponential Rosenbrock-Euler formulation. The matrix exponential and vector
product is computed using invert Krylov subspace method. Our proposed method
has several distinguished advantages over conventional formulations (e.g., the
well-known backward Euler with Newton-Raphson method). The matrix factorization
is performed only for the conductance/resistance matrix G, without being
performed for the combinations of the capacitance/inductance matrix C and
matrix G, which are used in traditional implicit formulations. Furthermore, due
to the explicit nature of our formulation, we do not need to repeat LU
decompositions when adjusting the length of time steps for error controls. Our
algorithm is better suited to solving tightly coupled post-layout circuits in
the pursuit for full-chip simulation. Our experimental results validate the
advantages of our framework.Comment: 6 pages; ACM/IEEE DAC 201
Low-rank updates and a divide-and-conquer method for linear matrix equations
Linear matrix equations, such as the Sylvester and Lyapunov equations, play
an important role in various applications, including the stability analysis and
dimensionality reduction of linear dynamical control systems and the solution
of partial differential equations. In this work, we present and analyze a new
algorithm, based on tensorized Krylov subspaces, for quickly updating the
solution of such a matrix equation when its coefficients undergo low-rank
changes. We demonstrate how our algorithm can be utilized to accelerate the
Newton method for solving continuous-time algebraic Riccati equations. Our
algorithm also forms the basis of a new divide-and-conquer approach for linear
matrix equations with coefficients that feature hierarchical low-rank
structure, such as HODLR, HSS, and banded matrices. Numerical experiments
demonstrate the advantages of divide-and-conquer over existing approaches, in
terms of computational time and memory consumption
System-theoretic trends in econometrics
Economics;Estimation;econometrics
NLO QCD corrections to top anti-top bottom anti-bottom production at the LHC: 1. quark-antiquark annihilation
The process pp -> top anti-top bottom anti-bottom + X represents a very
important background reaction to searches at the LHC, in particular to top
anti-top H production where the Higgs boson decays into a bottom anti-bottom
pair. A successful analysis of top anti-top H at the LHC requires the knowledge
of direct top anti-top bottom anti-bottom production at next-to-leading order
in QCD. We take the first step in this direction upon calculating the
next-to-leading-order QCD corrections to the subprocess initiated by quark
anti-quark annihilation. We devote an appendix to the general issue of rational
terms resulting from ultraviolet or infrared (soft or collinear) singularities
within dimensional regularization. There we show that, for arbitrary processes,
in the Feynman gauge, rational terms of infrared origin cancel in truncated
one-loop diagrams and result only from trivial self-energy corrections.Comment: 30 pages, LaTeX, 12 postscript figure
- âŠ