Accuracy and Stability of Numerical Algorithms
From MaRDI portal
(Redirected from Publication:4779477)
Recommendations
Cited in
(only showing first 100 items - show all)- An improved shifted CholeskyQR based on columns
- Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
- On the Sensitivity of Singular and Ill-Conditioned Linear Systems
- An energy and potential enstrophy conserving numerical scheme for the multi-layer shallow water equations with complete Coriolis force
- An active-set method for second-order conic-constrained quadratic programming
- Backward errors and small-sample condition estimation for ⋆-Sylveter equations
- Preconditioned multishift BiCG for \(\mathcal{H}_2\)-optimal model reduction
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
- Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
- The joint bidiagonalization process with partial reorthogonalization
- On the shift-invert Lanczos method for the buckling eigenvalue problem
- Multidimensional welfare comparisons of EU member states before, during, and after the financial crisis: a dominance approach
- Newton interpolation using \(\Re \)-Leja sequences
- Error bounds for computed least squares estimators
- The Block Rational Arnoldi Method
- Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic PDEs
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Solving rank-structured Sylvester and Lyapunov equations
- Non-replicability circumstances in a neural network model with Hodgkin-Huxley-type neurons
- Componentwise backward error analysis of Neville elimination
- Robust eigenstructure clustering by non-smooth optimisation
- Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank
- A mixed precision algorithm for the matrix square root
- Fast stability tests for Hermitian matrix polynomials
- Accelerating preconditioned Jacobi methods via perturbation-inspired pivoting
- Halving the size of skew-symmetric eigenvalue problems via the polar decomposition
- Roundoff error analysis of the double-exponential formula-based method for the matrix sign function
- Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
- The forward rounding error analysis of the partial pivoting quaternion LU decomposition
- CholeskyQR with randomization and pivoting for tall matrices (CQRRPT)
- Data-driven balancing of linear dynamical systems
- New implementations for the simultaneous-FETI method
- The Steklov-Poincaré technique for data completion: preconditioning and filtering
- Robust linear algebra
- On a quality measure for interval inclusions
- An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation
- Mixed precision HODLR matrices
- Generic symmetric matrix polynomials with bounded rank and fixed odd grade
- New uniformization methods with steady-state detection
- Condition numbers of the least squares problems with multiple right-hand sides
- Chebyshev acceleration of iterative refinement
- Simultaneous multidiagonalization for the CS decomposition
- Condition numbers for the Moore-Penrose inverse and the least squares problem involving rank-structured matrices
- On square roots and norms of matrices with symmetry properties
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- scientific article; zbMATH DE number 7561726 (Why is no real title available?)
- Fast enclosure for solutions of generalized Sylvester equations
- Regularized reconstruction of a surface from its measured gradient field
- Ill-conditioning of the truncated singular value decomposition, Tikhonov regularization and their applications to numerical partial differential equations.
- A pivoted LLL algorithm
- Componentwise error analysis for the block LU factorization of totally nonnegative matrices
- Some issues related to double rounding
- Polynomial sequences: elementary basic methods and application hints. A survey
- On the growth factor upper bound for Aasen's algorithm
- Schur aggregation for linear systems and determinants
- Backward stability with almost strictly sign regular matrices
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Schur functions through Lagrange polynomials
- A generalization of the Bott-Duffin inverse and its applications
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Fast enclosure for all eigenvalues in generalized eigenvalue problems
- Error Analysis of ZFP Compression for Floating-Point Data
- New scaling-squaring Taylor algorithms for computing the matrix exponential
- Iterative refinement of the QZ decomposition for solving linear DSGE models
- Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
- Stopping criteria for iterations in finite element methods
- Simulating Low Precision Floating-Point Arithmetic
- An optimal preconditioner for tensor equations involving Einstein product
- PACF: a precision-adjustable computational framework for solving singular values
- Precise numerical computation
- On computing root polynomials and minimal bases of matrix pencils
- Additive preconditioning and aggregation in matrix computations
- Meshless modeling of coupled transdermal pharmacokinetics with analytical validation
- Extending the Scope of Robust Quadratic Optimization
- Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
- Error bounds on complex floating-point multiplication
- Multivariable discrete MPC with exponential cost function on the automation of the anesthesia process
- A parallel and streaming dynamic mode decomposition algorithm with finite precision error analysis for large data
- Parallel reduction of four matrices to condensed form for a generalized matrix eigenvalue algorithm
- Error analysis of matrix multiplication with narrow range floating-point arithmetic
- A comparison of mixed precision iterative refinement approaches for least-squares problems
- Perturbation analysis for the periodic generalized coupled Sylvester equation
- Roundoff error analysis of the CholeskyQR2 algorithm in an oblique inner product
- Matrix representations for multi-degree B-splines
- A numerical solver for general bordered tridiagonal matrix equations
- Computing the Bézier control points of the Lagrangian interpolant in arbitrary dimension
- Solving SDGE models: a new algorithm for the Sylvester equation
- A multi-precision quadratic regularization method for unconstrained optimization with rounding error analysis
- Methods in numerical computation. Vol. 1: Systems of equations. Vol. 2: Functions of differential equations
- Exploring the numerics of branch-and-cut for mixed integer linear optimization
- Verified error bounds for multiple roots of systems of nonlinear equations
- Fast and accurate normalization of vectors and quaternions
- Multilinear polynomial systems: root isolation and bit complexity
- Line segment intersection testing
- An optimal error bound for \textsf{shiftedCholeskyQR3} in oblique inner product
- A note on the solution of not balanced banded Toeplitz systems
- The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature
- Anymatrix: an extensible MATLAB matrix collection
- On the QR decomposition of \({\mathcal {H}}\)-matrices
- Sparse linear least-squares problems
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)
