MatrixMarket
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Fields of values of linear pencils and spectral inclusion regions
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
- A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
- Middleware for the use of storage in communication.
- A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides
- An algorithm for computing minimal Geršgorin sets.
- Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices
- A multishift, multipole rational QZ method with aggressive early deflation
- Probabilistic bounds for the matrix condition number with extended Lanczos bidiagonalization
- A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
- A refined Arnoldi type method for large scale eigenvalue problems
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- A new approach for calculating the real stability radius
- A gradient based iterative algorithm for solving structural dynamics model updating problems
- The MIN-cut and vertex separator problem
- On a conjugate directions method for solving strictly convex QP problem
- How to Make Simpler GMRES and GCR More Stable
- NESSIE
- The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- Anymatrix: an extensible MATLAB matrix collection
- Multimedia representation of matrix computations and data
- Krylov subspace methods for discrete-time algebraic Riccati equations
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- The important modes of subsystems: a moment-matching approach
- A Newton-based method for the calculation of the distance to instability
- Numerical aspect of large-scale electronic state calculation for flexible device material
- Scientific computations on multi-core systems using different programming frameworks
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- Graph Drawing
- Iterative methods and preconditioning for large and sparse linear systems with applications
- Accelerating block coordinate descent methods with identification strategies
- A new framework for implicit restarting of the Krylov-Schur algorithm.
- Imposing symmetry in augmented linear systems.
- scientific article; zbMATH DE number 1497425 (Why is no real title available?)
- Additive and Multiplicative Two-Level Spectral Preconditioning for General Linear Systems
- A contour-integral based method for counting the eigenvalues inside a region
- Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
- Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
- Flexible GMRES with deflated restarting
- Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
- Predict-and-Recompute Conjugate Gradient Variants
- Multilevel Preconditioners Constructed From Inverse-Based ILUs
- TRAX: an approach for the time rational analysis of complex dynamic systems
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- The ILUCP Preconditioner
- A two-directional Arnoldi process and its application to parametric model order reduction
- scientific article; zbMATH DE number 1974130 (Why is no real title available?)
- Winding functions in transient magnetoquasistatic field-circuit coupled simulations
- Flexible incomplete Cholesky factorization with multi-parameters to control the number of nonzero elements in preconditioners
- Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
- Error estimation in preconditioned conjugate gradients
- The behavior of symmetric Krylov subspace methods for solving \(Mx=(M-\gamma I)v\).
- CsegGraph: a graph colouring instance generator
- Graph Drawing
- Modified incomplete orthogonal factorization methods using Givens rotations
- Constructing convex solutions via Perron's method
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Global simpler GMRES for nonsymmetric systems with multiple right-hand sides
- New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- Robust linear stability analysis and a new method for computing the action of the matrix exponential
- A practical algorithm for making filled graphs minimal
- A rational QZ method
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices
- A new method for computing Moore-Penrose inverse matrices
- Parallel stochastic estimation method of eigenvalue distribution
- The block-wise circumcentered-reflection method
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Approximate factoring of the inverse
- Improving GMRES(m) using an adaptive switching controller
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
- On correction equations and domain decomposition for computing invariant subspaces
- On Monte Carlo and quasi-Monte Carlo for matrix computations
- On global Hessenberg based methods for solving Sylvester matrix equations
- An inverse indefinite numerical range problem
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- On Hessenberg type methods for low-rank Lyapunov matrix equations
- A Two-Level Preconditioning Framework Based on a Richardson Iterative Process
- A simplified and flexible variant of \texttt{GCROT} for solving nonsymmetric linear systems
- Relaxation strategies for nested Krylov methods
- A method for computing a few eigenpairs of large generalized eigenvalue problems
- Constrained graph layout by stress majorization and gradient projection
- The minimum degree heuristic and the minimal triangulation process.
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems.
- Computing a partial generalized real Schur form using the Jacobi–Davidson method
- ROSTAPACK
- Bounds for an estimate of the optimal backward error for linear least squares problems
- CsegGraph
- PELLPACK
- PYTHIA
- NAXPERT
- CartaBlanca
- P-SPARSLIB
- SciNapse
- SoftLab
- TechTalk
- AQUARELS
- CMRH
- CTADEL
This page was built for software: MatrixMarket
