Accuracy and Stability of Numerical Algorithms
From MaRDI portal
Publication:4779477
DOI10.1137/1.9780898718027zbMATH Open1011.65010OpenAlexW2020804487WikidataQ47672713 ScholiaQ47672713MaRDI QIDQ4779477FDOQ4779477
Authors: Nicholas J. Higham 
Publication date: 27 November 2002
Full work available at URL: http://eprints.maths.manchester.ac.uk/238/4/asna2_cover.pdf
Recommendations
softwareNewton's methodtextbookbibliographybackward error analysisforward error analysistest matricesLAPACKfinite precision computation
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Roundoff error (65G50) Numerical linear algebra (65Fxx) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cited In (only showing first 100 items - show all)
- Error bounds for computed least squares estimators
- Newton interpolation using \(\Re \)-Leja sequences
- Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
- A generalization of the Bott-Duffin inverse and its applications
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Roundoff error analysis of the CholeskyQR2 algorithm in an oblique inner product
- Singular value decomposition in extended double precision arithmetic
- Computing the Bézier control points of the Lagrangian interpolant in arbitrary dimension
- Condition numbers for linear systems and Kronecker product linear systems with multiple right-hand sides
- A note on the solution of not balanced banded Toeplitz systems
- Matrix representations for multi-degree B-splines
- Anymatrix: an extensible MATLAB matrix collection
- Accurate and efficient evaluation of Chebyshev tensor product surface
- Optimal orthogonalization processes
- GMRES using pseudoinverse for range symmetric singular systems
- Multiple factorization of skew-symmetric matrices
- Structured condition numbers and small sample condition estimation of symmetric algebraic Riccati equations
- Rigorous multiplicative perturbation bounds for the generalized Cholesky factorization and the Cholesky-like factorization
- A note on the condition number of the scaled total least squares problem
- On the partial condition numbers for the indefinite least squares problem
- Small sample statistical condition estimation for the total least squares problem
- An adaptive approach to cube-based quasi-Monte Carlo integration on \(\mathbb R^d\)
- A stable parallel algorithm for block tridiagonal Toeplitz-block-Toeplitz linear systems
- On the structure of the solutions to the matrix equation \(G^\ast JG = J\)
- High-order integral nodal discontinuous Gegenbauer-Galerkin method for solving viscous Burgers' equation
- Relations between transfer matrices and numerical stability analysis to avoid the \(\Omega d\) problem
- Adaptive solution of infinite linear systems by Krylov subspace methods
- Numerical methods for parametric model reduction in the simulation of disk brake squeal
- Multipreconditioned GMRES for shifted systems
- Some characterizations of the distribution of the condition number of a complex Gaussian matrix
- Calculating the Discrete Spectrum of the Transport Operator with Arbitrary Order Anisotropic Scattering
- Randomized complete pivoting for solving symmetric indefinite linear systems
- On the numerical computation of bivariate Lagrange polynomials
- A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- On computing the density of integers of the form \(2^n + p\)
- Technical note: A robust perspective on transaction costs in portfolio optimization
- Calculating near-singular eigenvalues of the neutron transport operator with arbitrary order anisotropic scattering
- An arbitrary band structure construction of totally nonnegative matrices with prescribed eigenvalues
- Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Structured matrices in the application of bivariate interpolation to curve implicitization
- Error Analysis of TT-Format Tensor Algorithms
- Decomposition of the multi-dimensional time series identification problem
- On the algorithm by Al-Mohy and Higham for computing the action of the matrix exponential: a posteriori roundoff error estimation
- Sensitivity analysis for the block Cholesky downdating problem
- Condition numbers of the mixed least squares-total least squares problem revisited
- Error analysis for the predictor-corrector process relating to ill-conditioned linear system of equations
- A generalized isometric Arnoldi algorithm
- Fast matrix multiplication is stable
- On the solution of the nonlinear matrix equation \(X^n=f(X)\)
- Tight computationally efficient approximation of matrix norms with applications
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- Bernstein-Bezoutian matrices and curve implicitization
- Finite purchasing power and computations of Bertrand-Nash equilibrium prices
- Efficient implementations of the modified Gram-Schmidt orthogonalization with a non-standard inner product
- A computational status update for exact rational mixed integer programming
- Fast direct solvers for some complex symmetric block Toeplitz linear systems
- Comparing pivoting strategies for almost strictly sign regular matrices
- An algorithm for best rational approximation based on barycentric rational interpolation
- FFT formulations of adaptive Fourier decomposition
- Improved bounds for the inverses of diagonally dominant tridiagonal matrices
- On the numerical behavior of matrix splitting iteration methods for solving linear systems
- Computing periodic deflating subspaces associated with a specified set of eigenvalues
- Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
- On growth factors of the modified Gram-Schmidt algorithm
- An iterative algorithm for computing mean first passage times of Markov chains
- Componentwise enclosure for solutions of least squares problems and underdetermined systems
- The Jordan and Frobenius pairs of the inverse
- A symmetric linear system solver
- Small-sample statistical condition estimation of large-scale generalized eigenvalue problems
- Sensitivity of the Lanczos recurrence to Gaussian quadrature data: how malignant can small weights be?
- Phase function methods for second order linear ordinary differential equations with turning points
- Computing Gaussian quadrature rules with high relative accuracy
- Min-max elementwise backward error for roots of polynomials and a corresponding backward stable root finder
- A pivoting strategy for symmetric tridiagonal matrices
- On relative errors of floating-point operations: optimal bounds and applications
- A note on the componentwise perturbation bounds of matrix inverse and linear systems
- On mixed and componentwise condition numbers for indefinite least squares problem
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Computing the eigenvalues of symmetric tridiagonal matrices via a Cayley transformation
- Sharp estimates for perturbation errors in summations
- New rigorous perturbation bounds for the Cholesky-like factorization of skew-symmetric matrix
- Algebraic Error Analysis for Mixed-Precision Multigrid Solvers
- General strong polarization
- Efficient recursive least squares solver for rank-deficient matrices
- Roundoff errors for polynomial evaluation by a family of formulae
- Mixed precision path tracking for polynomial homotopy continuation
- A fast and efficient algorithm for solving ill-conditioned linear systems
- Improving the numerical stability of fast matrix multiplication
- Structured condition numbers for some matrix factorizations of structured matrices
- A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
- An efficient computation of generalized inverse of a matrix
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Block Gram-Schmidt algorithms and their stability properties
- Accelerated multiple precision matrix multiplication using Strassen's algorithm and Winograd's variant
- On iterative solution of the extended normal equations
- On the Iwasawa decomposition of a symplectic matrix
- On the Lebesgue measure of the Feigenbaum Julia set
- Invariance preserving discretization methods of dynamical systems
Uses Software
This page was built for publication: Accuracy and Stability of Numerical Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779477)
