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)
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Ill-conditioning of the truncated singular value decomposition, Tikhonov regularization and their applications to numerical partial differential equations.
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Regularized reconstruction of a surface from its measured gradient field
- Schur aggregation for linear systems and determinants
- Chebyshev acceleration of iterative refinement
- Simultaneous multidiagonalization for the CS decomposition
- On square roots and norms of matrices with symmetry properties
- Fast enclosure for solutions of generalized Sylvester equations
- Verified error bounds for multiple roots of systems of nonlinear equations
- Additive preconditioning and aggregation in matrix computations
- Stopping criteria for iterations in finite element methods
- Fast enclosure for all eigenvalues in generalized eigenvalue problems
- Precise numerical computation
- Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
- Rigorous and Efficient Short Lattice Vectors Enumeration
- On the QR decomposition of \({\mathcal {H}}\)-matrices
- LU factorization of the Vandermonde matrix and its applications
- Structured backward errors for two kinds of generalized saddle point systems
- On the numerical stability of algorithmic differentiation
- Optimal correction of the absolute value equations
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
- Perturbation analysis for a class of fuzzy linear systems
- A posteriori error bounds for discrete balanced truncation
- On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic
- Structured backward errors for generalized saddle point systems
- New progress in real and complex polynomial root-finding
- Twice Is Enough for Dangerous Eigenvalues
- The Hertz contact problem, coupled Volterra integral equations and a linear complementarity problem
- Growth factors of pivoting strategies associated with Neville elimination
- Reducing rounding errors and achieving Brouwer's law with Taylor series method
- Three-level parallel J-Jacobi algorithms for Hermitian matrices
- On the numerical evaluation of Fredholm determinants
- Growth factor and expected growth factor of some pivoting strategies
- Balanced incomplete factorization preconditioner with pivoting
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- Efficient approximation of random fields for numerical applications
- Algorithms for accurate, validated and fast polynomial evaluation
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case
- Accurate simple zeros of polynomials in floating point arithmetic
- Verification of positive definiteness
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Computational complexity of iterated maps on the interval
- Fast interval matrix multiplication
- On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity
- How do you compute the midpoint of an interval?
- Block \(\mathbf {LU}\) factors of generalized companion matrix pencils
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- Accurate evaluation of a polynomial in Chebyshev form
- Accurate matrix exponential computation to solve coupled differential models in engineering
- Reconstruction of conditional expectations from product moments with applications
- A more accurate algorithm for computing the Christoffel transformation
- Stable solutions of linear systems involving long chain of matrix multiplications
- Tests for the recognition of total positivity
- Structured backward error analysis for generalized saddle point problems
- A natural absolute coordinate formulation for the kinematic and dynamic analysis of rigid multibody systems
- An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
- Matrix sparsification and the sparse null space problem
- Efficient orthogonal matrix polynomial based method for computing matrix exponential
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
- Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations
- Analysis of direct searches for discontinuous functions
- A new error-free floating-point summation algorithm
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- New studies of randomized augmentation and additive preprocessing
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- Robust attitude tracking control for a rigid spacecraft under input delays and actuator errors
- Matrix exponentials and parallel prefix computation in a quantum control problem
- Stability and sensitivity of tridiagonal LU factorization without pivoting
- Solving linear systems of equations with randomization, augmentation and aggregation
- On normwise structured backward errors for the generalized saddle point systems
- A collocation approach for solving high-order linear Fredholm-Volterra integro-differential equations
- Matrix computations and polynomial root-finding with preprocessing
- Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction
- A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU-GPU platforms
- 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
- Structured perturbations of group inverse and singular linear system with index one
- Stable generalized finite element method (SGFEM)
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming
- Effective condition number for weighted linear least squares problems and applications to the Trefftz method
- A fast direct solver for scattering from periodic structures with multiple material interfaces in two dimensions
- Perturbation analysis for the generalized Schur complement of a positive semi-definite matrix
- Sylvester equations and the numerical solution of partial fractional differential equations
- Additive preconditioning for matrix computations
- Additive preconditioning, eigenspaces, and the inverse iteration
- Randomized preprocessing of homogeneous linear systems of equations
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- Towards dense linear algebra for hybrid GPU accelerated manycore systems
- A note on backward errors for structured linear systems
- Randomized preprocessing versus pivoting
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- The Schur aggregation and solving ill conditioned linear systems: the convergence theorem
- Fast enclosure for solutions of Sylvester equations
- Simple backward error bounds for linear least-squares problems
- The orthonormalized generalized finite element method-OGFEM: efficient and stable reduction of approximation errors through multiple orthonormalized enriched basis functions
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)
