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)
- Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic PDEs
- The joint bidiagonalization process with partial reorthogonalization
- Multidimensional welfare comparisons of EU member states before, during, and after the financial crisis: a dominance approach
- An optimal preconditioner for tensor equations involving Einstein product
- Polynomial sequences: elementary basic methods and application hints. A survey
- On the condition number theory of the equality constrained indefinite least squares problem
- A condition analysis of the weighted linear least squares problem using dual norms
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Mixed precision algorithms in numerical linear algebra
- Perturbation analysis for the hyperbolic QR factorization
- Solving generalized CDT problems via two-parameter eigenvalues
- A bootstrap method for error estimation in randomized matrix multiplication
- Computer algebra for guaranteed accuracy. How does it help?
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
- Learning algebraic varieties from samples
- Computing the matrix Mittag-Leffler function with applications to fractional calculus
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Inexact half-quadratic optimization for linear inverse problems
- Stochastic Rounding Variance and Probabilistic Bounds: A New Approach
- Backward errors for eigenproblem of two kinds of structured matrices
- A robust algorithm for geometric predicate by error-free determinant transformation
- The functions erf and erfc computed with arbitrary precision and explicit error bounds
- Reduced-rank gradient-based algorithms for generalized coupled Sylvester matrix equations and its applications
- Adaptive and efficient algorithm for 2D orientation problem
- Absolute value equations with tensor product structure: unique solvability and numerical solution.
- Coefficient characterization of linear differential equations with maximal symmetries
- Computing enclosures for the matrix exponential
- Stochastic arithmetic in multiprecision
- A user-friendly method for computing indefinite integrals of oscillatory functions
- Verified computation for the geometric mean of two matrices
- On perturbation bounds of Kronecker product linear systems and their level-2 condition numbers
- Hadamard matrices: insights into their growth factor and determinant computations
- Computing nearby non-trivial Smith forms
- Using dual techniques to derive componentwise and mixed condition numbers for a linear function of a linear least squares solution
- Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces
- Generic complete eigenstructures for sets of matrix polynomials with bounded rank and degree
- Reorthogonalized block classical Gram-Schmidt
- An iterative method for symmetric positive semidefinite linear system of equations
- A breakdown-free algorithm for computing the determinants of periodic tridiagonal matrices
- Convergence analysis of an algorithm for accurate inverse Cholesky factorization
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Numerical instability of resultant methods for multidimensional rootfinding
- Improved rigorous perturbation bounds for the LU and QR factorizations.
- Recurrence relations and determinant forms for general polynomial sequences. Application to Genocchi polynomials
- Structured condition numbers of structured Tikhonov regularization problem and their estimations
- A tearing-based hybrid parallel sparse linear system solver
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- On the global convergence of Schröder's iteration formula for real zeros of entire functions
- Bounds for an estimate of the optimal backward error for linear least squares problems
- The design and use of a sparse direct solver for skew symmetric matrices
- Condition numbers of generalized saddle point systems
- Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- Coordinated speed oscillations in schooling killifish enrich social communication
- Efficient algorithm for simultaneous reduction to the \(m\)-Hessenberg-triangular-triangular form
- Estimating the condition number of \(f(A)b\)
- Perturbation analysis for the matrix least squares problem \(A X B = C\)
- Efficient polynomial reduction
- A quasi-Newton method with rank-two update to solve interval optimization problems
- Structured doubling algorithms for weakly stabilizing Hermitian solutions of algebraic Riccati equations
- Iterative refinement for symmetric eigenvalue decomposition
- On condition numbers for least squares with quadric inequality constraint
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
- Rigorous roundoff error analysis of probabilistic floating-point computations
- Bayesian Probabilistic Numerical Methods
- Condition numbers for a linear function of the solution to the constrained and weighted least squares problem and their statistical estimation
- A quasilinear complexity algorithm for the numerical simulation of scattering from a two-dimensional radially symmetric potential
- Matrix calculus-based approach to orthogonal polynomial sequences
- Upper bounds on the distribution of the condition number of singular matrices
- Some sets of relative stability against perturbations of branching continued fractions with complex elements and variable number of branches
- On level-2 condition number for the weighted Moore-Penrose inverse
- Mathematics and numerics for balance partial differential-algebraic equations (PDAEs)
- The performance of phase-lag enhanced explicit Runge-Kutta Nyström pairs on \(N\)-body problems
- Extended version with the analysis of dynamic system for iterative refinement of solution
- Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
- Sign consistent linear programming problems
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
- On the infinitesimal limits of the Schur complements of tridiagonal matrices
- The numerical condition of univariate and bivariate degree elevated Bernstein polynomials
- An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order
- Novel modifications of parallel Jacobi algorithms
- Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- Varying the \(s\) in your \(s\)-step GMRES
- Iterative Solution of Saddle-Point Systems from Radial Basis Function (RBF) Interpolation
- A New Approach to Probabilistic Rounding Error Analysis
- On the stability of some algorithms for computing the action of the matrix exponential
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
- A more accurate Briggs method for the logarithm
- Condition numbers and perturbation analysis for the Tikhonov regularization of discrete ill-posed problems.
- Hybrid Ikebe-Newton's iteration for inverting general nonsingular Hessenberg matrices
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Probabilistic Error Analysis for Inner Products
- Formal verification of numerical programs: from C annotated programs to mechanical proofs
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- Computing the conditioning of the components of a linear least-squares solution
- On Frobenius normwise condition numbers for Moore–Penrose inverse and linear least-squares problems
- The perturbation bounds for the solution of weighted Kronecker product linear systems using the \(W\)-weighted Drazin inverse
- An Algorithm for the Matrix Lambert $W$ Function
- A Newton-Krylov method with an approximate analytical Jacobian for implicit solution of Navier-Stokes equations on staggered overset-curvilinear grids with immersed boundaries
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)
