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)
On normwise structured backward errors for the generalized saddle point systems ⋮ Numerically safe Gaussian elimination with no pivoting ⋮ Small sample statistical condition estimation for the total least squares problem ⋮ FFT formulations of adaptive Fourier decomposition ⋮ The Hertz contact problem, coupled Volterra integral equations and a linear complementarity problem ⋮ On the Iwasawa decomposition of a symplectic matrix ⋮ Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices ⋮ A more accurate algorithm for computing the Christoffel transformation ⋮ Full scale multi-output Gaussian process emulator with nonseparable auto-covariance functions ⋮ An energy and potential enstrophy conserving numerical scheme for the multi-layer shallow water equations with complete Coriolis force ⋮ Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method ⋮ Schur aggregation for linear systems and determinants ⋮ VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems ⋮ Tests for the recognition of total positivity ⋮ Partitioned general linear methods for separable Hamiltonian problems ⋮ Quotient elastic metrics on the manifold of arc-length parameterized plane curves ⋮ Uniform approximation to Cauchy principal value integrals with logarithmic singularity ⋮ On the algorithm by Al-Mohy and Higham for computing the action of the matrix exponential: a posteriori roundoff error estimation ⋮ An arbitrary band structure construction of totally nonnegative matrices with prescribed eigenvalues ⋮ A posteriori error analysis of round-off errors in the numerical solution of ordinary differential equations ⋮ Randomized matrix-free trace and log-determinant estimators ⋮ Generic complete eigenstructures for sets of matrix polynomials with bounded rank and degree ⋮ Error estimates for the summation of real numbers with application to floating-point summation ⋮ On the statistical model of source localization based on range difference measurements ⋮ Generic skew-symmetric matrix polynomials with fixed rank and fixed odd grade ⋮ On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity ⋮ An inverse model and mathematical solution for inferring viscoelastic properties and dynamic deformations of heterogeneous structures ⋮ Stable generalized finite element method and associated iterative schemes; application to interface problems ⋮ A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization ⋮ Comparing pivoting strategies for almost strictly sign regular matrices ⋮ Add-sub pivoting triangular factorization for symmetric matrix ⋮ Condition numbers of generalized saddle point systems ⋮ Additive preconditioning and aggregation in matrix computations ⋮ On level-2 condition number for the weighted Moore-Penrose inverse ⋮ On generalized matrix approximation problem in the spectral norm ⋮ Fast algorithms for floating-point interval matrix multiplication ⋮ Accurate solutions of \(M\)-matrix Sylvester equations ⋮ Segmented tau approximation for a forward-backward functional differential equation ⋮ A pivoted LLL algorithm ⋮ Some issues related to double rounding ⋮ Componentwise error analysis for the block LU factorization of totally nonnegative matrices ⋮ On the stability of some algorithms for computing the action of the matrix exponential ⋮ Componentwise enclosure for solutions of least squares problems and underdetermined systems ⋮ On mixed and componentwise condition numbers for indefinite least squares problem ⋮ Eigensensitivity analysis of damped systems with distinct and repeated eigenvalues ⋮ A note on iterative refinement for seminormal equations ⋮ Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils ⋮ Componentwise backward error analysis of Neville elimination ⋮ New bounds for roots of polynomials based on Fiedler companion matrices ⋮ Conditioning and accurate computations with Pascal matrices ⋮ Two kinds of condition numbers for the quadratic matrix equation ⋮ Approximate varieties, approximate ideals and dimension reduction ⋮ Fast linear algebra is stable ⋮ Roundoff error analysis of fast DCT algorithms in fixed point arithmetic ⋮ Computing periodic deflating subspaces associated with a specified set of eigenvalues ⋮ Numerical solution of a Fredholm integro-differential equation modelling \(\dot \theta\)-neural networks ⋮ Adaptive solution of infinite linear systems by Krylov subspace methods ⋮ A Jacobi-Davidson type method for the product eigenvalue problem ⋮ Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches ⋮ Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations ⋮ Fast direct solvers for some complex symmetric block Toeplitz linear systems ⋮ Upper bounds on the distribution of the condition number of singular matrices ⋮ Error bounds for computed least squares estimators ⋮ Numerical solutions of systems of high-order Fredholm integro-differential equations using Euler polynomials ⋮ Sensitivity analysis for the generalized Cholesky factorization ⋮ A breakdown-free algorithm for computing the determinants of periodic tridiagonal matrices ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix ⋮ Linear-time CUR approximation of BEM matrices ⋮ Iterative refinement for singular value decomposition based on matrix multiplication ⋮ The relative accuracy of \(\mathtt{(x+y)*(x-y)}\) ⋮ Reproducibility strategies for parallel preconditioned conjugate gradient ⋮ Verified bounds for the determinant of real or complex point or interval matrices ⋮ Coefficient characterization of linear differential equations with maximal symmetries ⋮ Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions ⋮ Single-pass randomized algorithms for LU decomposition ⋮ On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices ⋮ Backward error and condition number of a generalized Sylvester equation, with application to the stochastic Galerkin method ⋮ Efficient numerical algorithms for constructing orthogonal generalized doubly stochastic matrices ⋮ Numerical validation of compensated algorithms with stochastic arithmetic ⋮ Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues ⋮ Efficient implementations of the modified Gram-Schmidt orthogonalization with a non-standard inner product ⋮ A note on the \(\top\)-Stein matrix equation ⋮ Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary ⋮ Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series ⋮ Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\) ⋮ Polynomial sequences: elementary basic methods and application hints. A survey ⋮ On the numerical stability of Newton's formula for Lagrange interpolation ⋮ On linear-time solvers for comrade linear systems ⋮ Optimal interval length for the collocation of the Newton interpolation basis ⋮ An effective implementation of a modified Laguerre method for the roots of a polynomial ⋮ An accurate algorithm for evaluating rational functions ⋮ Accurate evaluation of polynomials in Legendre basis ⋮ Full rank Cholesky factorization for rank deficient matrices ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem ⋮ Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation ⋮ A new method of convergence acceleration of series expansion for analytic functions in the complex domain ⋮ Componentwise accurate fluid queue computations using doubling algorithms ⋮ Regularized reconstruction of a surface from its measured gradient field ⋮ Numerically stable formulas for a particle-based explicit exponential integrator
Uses Software
This page was built for publication: Accuracy and Stability of Numerical Algorithms
