Accuracy and Stability of Numerical Algorithms
From MaRDI portal
Publication:4779477
DOI10.1137/1.9780898718027zbMath1011.65010OpenAlexW2020804487WikidataQ47672713 ScholiaQ47672713MaRDI QIDQ4779477
Publication date: 27 November 2002
Full work available at URL: http://eprints.maths.manchester.ac.uk/238/4/asna2_cover.pdf
softwareNewton's methodbibliographytextbookbackward error analysisforward error analysistest matricesLAPACKfinite precision computation
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Roundoff error (65G50) Software, source code, etc. for problems pertaining to linear algebra (15-04) Numerical linear algebra (65Fxx)
Related Items (only showing first 100 items - show all)
A note on computing the inverse of a triangular Toeplitz matrix ⋮ Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem ⋮ An accurate updating formula to calculate sample variance from weighted successive differences ⋮ Condition number and backward errors of nonsymmetric algebraic Riccati equation ⋮ On the numerical stability of Floater-Hormann's rational interpolant ⋮ Improved error bounds for floating-point products and Horner's scheme ⋮ On the definition of unit roundoff ⋮ Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison. ⋮ A mixed derivative terms removing method in multi-asset option pricing problems ⋮ Simple floating-point filters for the two-dimensional orientation problem ⋮ Numerically stable methods for the computation of exit rates in Markov chains ⋮ Backward error analysis of the shift-and-invert Arnoldi algorithm ⋮ Scaling damped limited-memory updates for unconstrained optimization ⋮ On computability and triviality of well groups ⋮ Rigorous approximation of diffusion coefficients for expanding maps ⋮ Dynamic scaling on the limited memory BFGS method ⋮ A natural absolute coordinate formulation for the kinematic and dynamic analysis of rigid multibody systems ⋮ Matrix sparsification and the sparse null space problem ⋮ An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix ⋮ New studies of randomized augmentation and additive preprocessing ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ Sharp error bounds for complex floating-point inversion ⋮ Analysis of the effects of a pulsed electromagnetic field on the dynamic response of electrically conductive composites ⋮ A fast direct solver for scattering from periodic structures with multiple material interfaces in two dimensions ⋮ Sylvester equations and the numerical solution of partial fractional differential equations ⋮ Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations ⋮ A fast solver for linear systems with displacement structure ⋮ The Schur aggregation and solving ill conditioned linear systems: the convergence theorem ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ Accurate evaluation of a polynomial and its derivative in Bernstein form ⋮ Fast enclosure for solutions of Sylvester equations ⋮ Simple backward error bounds for linear least-squares problems ⋮ Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem ⋮ Simultaneous multidiagonalization for the CS decomposition ⋮ Chebyshev acceleration of iterative refinement ⋮ On square roots and norms of matrices with symmetry properties ⋮ Fast enclosure for solutions of generalized Sylvester equations ⋮ Accurate matrix exponential computation to solve coupled differential models in engineering ⋮ Uncertainty propagation or box propagation ⋮ On the numerical stability of algorithmic differentiation ⋮ Matrix computations and polynomial root-finding with preprocessing ⋮ A posteriori error bounds for discrete balanced truncation ⋮ On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic ⋮ Stable, linear spline wavelets on nonuniform knots with vanishing moments ⋮ Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals ⋮ Structured backward errors for generalized saddle point systems ⋮ An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems ⋮ Growth factors of pivoting strategies associated with Neville elimination ⋮ Running error for the evaluation of rational Bézier surfaces through a robust algorithm ⋮ Stable generalized finite element method (SGFEM) ⋮ Reducing rounding errors and achieving Brouwer's law with Taylor series method ⋮ Three-level parallel J-Jacobi algorithms for Hermitian matrices ⋮ Efficient orthogonal matrix polynomial based method for computing matrix exponential ⋮ Polynomial algebra for Birkhoff interpolants ⋮ An algorithm for automatically selecting a suitable verification method for linear systems ⋮ Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse ⋮ Analysis of direct searches for discontinuous functions ⋮ Mixed and componentwise condition numbers of nonsymmetric algebraic Riccati equation ⋮ Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices ⋮ On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\) ⋮ Min matrices and mean matrices ⋮ Full-rank representations of outer inverses based on the QR decomposition ⋮ Computational complexity of iterated maps on the interval ⋮ Fast interval matrix multiplication ⋮ Solving linear systems of equations with randomization, augmentation and aggregation ⋮ Reconstruction of conditional expectations from product moments with applications ⋮ Algorithm singularity of the null-field method for Dirichlet problems of Laplace's equation in annular and circular domains ⋮ Regularized symmetric positive definite matrix factorizations for linear systems arising from RBF interpolation and differentiation ⋮ A sharp error bound of the approximate solutions for saddle point linear systems ⋮ The stability of barycentric interpolation at the Chebyshev points of the second kind ⋮ Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications ⋮ Accurate solutions of diagonally dominant tridiagonal linear systems ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Kepler accuracy model for co-periodic satellite separation extrema ⋮ Fast ESPRIT algorithms based on partial singular value decompositions ⋮ On the epistemological analysis of modeling and computational error in the mathematical sciences ⋮ Spectral integration of linear boundary value problems ⋮ Condition numbers for the nonlinear matrix equation and their statistical estimation ⋮ A flexible condition number for weighted linear least squares problem and its statistical estimation ⋮ Max-plus singular values ⋮ Covariance structure regularization via Frobenius-norm discrepancy ⋮ Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices ⋮ Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications ⋮ The effects of rounding errors in the nodes on barycentric interpolation ⋮ Backward error analysis of Choleski Q.I.F. for the solution of symmetric positive definite linear systems ⋮ A fast and reliable numerical solver for general bordered \(k\)-tridiagonal matrix linear equations ⋮ Inverse-free recursive multiresolution algorithms for a data approximation problem ⋮ The stability of extended Floater-Hormann interpolants ⋮ The program LOPT for least-squares optimization of energy levels ⋮ Perturbation, extraction and refinement of invariant pairs for matrix polynomials ⋮ A framework for analyzing nonlinear eigenproblems and parametrized linear systems ⋮ Stable solutions of linear systems involving long chain of matrix multiplications ⋮ Wavelet based ILU preconditioners for the numerical solution by PUFEM of high frequency elastic wave scattering ⋮ Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications ⋮ Breaking the limits: The Taylor series method ⋮ Factoring matrices with a tree-structured sparsity pattern ⋮ Structured eigenvalue condition numbers and linearizations for matrix polynomials ⋮ New progress in real and complex polynomial root-finding ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Schur functions through Lagrange polynomials
Uses Software
This page was built for publication: Accuracy and Stability of Numerical Algorithms
