Matrix Algorithms

From MaRDI portal
Revision as of 14:24, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2755107

DOI10.1137/1.9780898718058zbMath0984.65031OpenAlexW4242722506MaRDI QIDQ2755107

G. W. Stewart

Publication date: 6 November 2001

Full work available at URL: https://doi.org/10.1137/1.9780898718058




Related Items (only showing first 100 items - show all)

Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random SparsificationRandomized numerical linear algebra: Foundations and algorithmsA Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large MatricesNew Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse MatricesOptimal Experimental Design for Inverse Problems with State ConstraintsData Driven Modal Decompositions: Analysis and EnhancementsNewton Correction Methods for Computing Real Eigenpairs of Symmetric TensorsPreconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior EigenvaluesThe $QR$ Steps with Perfect ShiftsTheoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue ProblemsNonlinearly Perturbed Stochastic Processes and SystemsPreconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian MatricesDistributed discrete‐time optimization algorithms with applications to resource allocation in epidemics controlA Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue ProblemsOn the regularization of convolutional kernel tensors in neural networksThe Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, RevisitedAccelerating Convergence by Augmented Rayleigh--Ritz Projections For Large-Scale Eigenpair ComputationKrylov--Schur-Type Restarts for the Two-Sided Arnoldi MethodFast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear AlgebraScalable implementation of polynomial filtering for density functional theory calculation in PARSECA homogeneous Rayleigh quotient with applications in gradient methodsA compact heart iteration for low-rank approximations of large matricesNumerical solution of singular Sylvester equationsAdvanced shifted sixth-kind Chebyshev tau approach for solving linear one-dimensional hyperbolic telegraph type problemA literature survey of matrix methods for data scienceA FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matricesAn efficient reduced‐order method for stochastic eigenvalue analysisUnnamed ItemSpectral properties of Google matrix of Wikipedia and other networksSpectral collocation method for convection-diffusion equationFlows of rare events for regularly perturbed semi-Markov processesA Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality ConstraintsTrace ratio optimization with an application to multi-view learningThe Block Rational Arnoldi MethodDeflated and restarted Krylov subspace methods for Sylvester tensor equationsPoincaré recurrences and Ulam method for the Chirikov standard mapFirst-Order Perturbation Theory for Eigenvalues and EigenvectorsAn Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given IntervalTwo Conjectures on the Stokes Complex in Three Dimensions on Freudenthal MeshesAsymptotic estimations of a perturbed symmetric eigenproblemLiterature survey on low rank approximation of matricesRegularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximationsNumerical solution of linear eigenvalue problemsA Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue ProblemsUnnamed ItemSketching for Principal Component RegressionA Krylov Subspace Method for the Approximation of Bivariate Matrix FunctionsComponentwise Perturbation Analysis of the Schur Decomposition of a MatrixA Twin Error Gauge for Kaczmarz's IterationsSensitivity Analysis for Maxwell Eigenvalue Problems in Industrial ApplicationsAn efficient algorithm for second-order cone linear complementarity problemsSpectral recycling strategies for the solution of nonlinear eigenproblems in thermoacousticsRestructuring the Tridiagonal and Bidiagonal QR Algorithms for PerformanceHarmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problemComplementary cycles of restarted GMRESThe convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectorsKrylov subspaces and the analytic gradeA power method for nonlinear operatorsBackword error bounds for approximate Krylov subspacesFinite Differences in Forward and Inverse Imaging Problems: MaxPol DesignRobust Linear Stability Analysis and a New Method for Computing the Action of the Matrix ExponentialStudies on Jacobi–Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updatesA conjugate-gradient-type rational Krylov subspace method for ill-posed problemsBackward error and conditioning of Fiedler companion linearizationsPRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale ComputationsThick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problemJ -lossless and extended J -lossless factorizations approach for @-domain H ∞ controlCoupling and ergodic theorems for Markov chains with damping componentLinear system solution by null-space approximation and projection (SNAP)On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD ComputationsLow-Rank Solution Methods for Stochastic Eigenvalue ProblemsThe bounds of the eigenvalues for rank-one modification of Hermitian matrixUnnamed ItemAn extended QR-solver for large profiled matricesFast diagonalization of evolving matrices: application to spin-fermion modelsSubsampling Algorithms for Semidefinite ProgrammingA parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPcA Twin Error Gauge for Kaczmarz's IterationsError Bounds for Dynamical Spectral EstimationThe low rank approximations and Ritz values in LSQR for linear discrete ill-posed problemImproved seed methods for symmetric positive definite linear equations with multiple right‐hand sidesMemory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basisModel-order reduction of large-scalekth-order linear dynamical systems via akth-order Arnoldi methodAn Eigenvalue-Based Method for the Unbalanced Procrustes ProblemFrobenius–Perron eigenstates in deformed microdisk cavities: non-Hermitian physics and asymmetric backscattering in ray dynamicsStrongly Damped Quadratic Matrix PolynomialsUnnamed ItemSharp Estimation of Convergence Rate for Self-Consistent Field Iteration to Solve Eigenvector-Dependent Nonlinear Eigenvalue ProblemsGeneralized Rational Krylov Decompositions with an Application to Rational ApproximationHigh-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point AlgorithmOptimal Regularized Inverse Matrices for Inverse ProblemsTwice Is Enough for Dangerous EigenvaluesA truncated-CG style method for symmetric generalized eigenvalue problemsOptimal direct velocity feedbackA spectral analysis of subspace enhanced preconditionersiSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big dataA framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integratorsAn Elsner-like perturbation theorem for generalized eigenvaluesA simple formula to find the closest consistent matrix to a reciprocal matrixOptimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces







This page was built for publication: Matrix Algorithms