Pages that link to "Item:Q4114699"
From MaRDI portal
The following pages link to Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization (Q4114699):
Displaying 49 items.
- On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems (Q2441140) (← links)
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process (Q2486676) (← links)
- Constructing a speculative kernel machine for pattern classification (Q2488681) (← links)
- A periodic Krylov-Schur algorithm for large matrix products (Q2494376) (← links)
- A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices (Q2494666) (← links)
- Diffusion wavelets (Q2497980) (← links)
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
- A comparison of algorithms for forming the QR decomposition for use in regression (Q2563596) (← links)
- Improved Gram-Schmidt type downdating methods (Q2572606) (← links)
- A new technique for determining coupled modes of structure-acoustic systems (Q2630958) (← links)
- A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization (Q2660095) (← links)
- GMRES algorithms over 35 years (Q2698151) (← links)
- Stability analysis of the two-level orthogonal Arnoldi procedure (Q2790068) (← links)
- A DEIM induced CUR factorization (Q2810324) (← links)
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems (Q2818245) (← links)
- Gram-Schmidt orthogonalization: 100 years and more (Q2931519) (← links)
- Modifiable low-rank approximation to a matrix (Q3011661) (← links)
- On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices (Q3195438) (← links)
- A weighted gram-schmidt method for convex quadratic programming (Q3337227) (← links)
- On QR factorization updatings (Q3355212) (← links)
- A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices (Q3886737) (← links)
- A stable method for solving certain constrained least squares problems (Q4194741) (← links)
- Three new algorithms based on the sequential secant method (Q4199452) (← links)
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques (Q4389261) (← links)
- Quaternions in Collective Dynamics (Q4601617) (← links)
- Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems (Q4683929) (← links)
- An algorithm for hierarchical optimization of large-scale problems with nested structure (Q4745631) (← links)
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems (Q4889928) (← links)
- Initial Guesses for Sequences of Linear Systems in a GPU-Accelerated Incompressible Flow Solver (Q5005006) (← links)
- Efficient Krylov Subspace Techniques for Model Order Reduction of Automotive Structures in Vibroacoustic Applications (Q5014029) (← links)
- Modulus-based iterative methods for constrained <b> <i>ℓ</i> </b> <sub> <i>p</i> </sub>–<b> <i>ℓ</i> </b> <sub> <i>q</i> </sub> minimization (Q5117383) (← links)
- Projected Newton method for noise constrained ℓ <sub> p </sub> regularization (Q5139326) (← links)
- A geometric approach to subspace updates and orthogonal matrix decompositions under rank-one modifications (Q5145095) (← links)
- Regularization of nonlinear ill-posed problems by exponential integrators (Q5192618) (← links)
- Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations (Q5230631) (← links)
- The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software (Q5230632) (← links)
- Robust Multisecant Quasi-Newton Variants for Parallel Fluid-Structure Simulations---and Other Multiphysics Applications (Q5372635) (← links)
- Hybrid projection methods for large-scale inverse problems with mixed Gaussian priors (Q5854067) (← links)
- Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces (Q6038831) (← links)
- Some numerical aspects of Arnoldi-Tikhonov regularization (Q6101769) (← links)
- A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering (Q6123343) (← links)
- A Gauss-Newton method for mixed least squares-total least squares problems (Q6126121) (← links)
- Deflated and restarted Krylov subspace methods for Sylvester tensor equations (Q6166090) (← links)
- Fractional graph Laplacian for image reconstruction (Q6546941) (← links)
- Software for limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces (Q6572625) (← links)
- Reorthogonalized block classical Gram-Schmidt using two Cholesky-based TSQR algorithms (Q6592218) (← links)
- A LAPACK implementation of the dynamic mode decomposition (Q6604151) (← links)
- A numerically stable communication-avoiding \(s\)-step GMRES algorithm (Q6641763) (← links)
