Bindel et al., 2005 - Google Patents
A fast and stable nonsymmetric eigensolver for certain structured matricesBindel et al., 2005
View PDF- Document ID
- 1451102826771804442
- Author
- Bindel D
- Chandresekaran S
- Demmel J
- Garmire D
- Gu M
- Publication year
- Publication venue
- Technical report
External Links
Snippet
We consider the set of matrices which differ from symmetric, skew symmetric, or unitary by only a low rank modification. This class of matrices includes companion matrices, arrow matrices, and matrices corresponding to mechanical oscillators with localized damping. We …
- 239000011159 matrix material 0 abstract description 83
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
- G06F17/12—Simultaneous equations, e.g. systems of linear equations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
- G06F17/13—Differential equations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
- G06F17/5018—Computer-aided design using simulation using finite difference methods or finite element methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/17—Function evaluation by approximation methods, e.g. inter- or extrapolation, smoothing, least mean square method
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
- G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
- G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Vasudevan et al. | A hierarchical singular value decomposition algorithm for low rank matrices | |
Benner et al. | Balanced truncation model reduction of large-scale dense systems on parallel computers | |
Rakhuba et al. | Fast multidimensional convolution in low-rank tensor formats via cross approximation | |
Vogel et al. | Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions | |
Vervliet et al. | Exploiting efficient representations in large-scale tensor decompositions | |
Benzi et al. | Matrices with hierarchical low-rank structures | |
De Marchi et al. | Fast computation of orthonormal basis for RBF spaces through Krylov space methods | |
Shi et al. | Parallel algorithms for computing the tensor-train decomposition | |
Benner et al. | Algorithm 854: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II | |
Chen et al. | Randomized matrix-free quadrature for spectrum and spectral sum approximation | |
Aurentz et al. | Stable computation of generalized matrix functions via polynomial interpolation | |
Ou et al. | Superdc: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices | |
Bindel et al. | A fast and stable nonsymmetric eigensolver for certain structured matrices | |
Frison | Numerical methods for model predictive control | |
Boito et al. | Implicit QR for rank-structured matrix pencils | |
Van Barel et al. | An orthogonal similarity reduction of a matrix into semiseparable form | |
Al Daas et al. | Parallel tensor train rounding using Gram SVD | |
Nool et al. | A parallel Jacobi--Davidson-type method for solving large generalized eigenvalue problems in magnetohydrodynamics | |
Lampe et al. | A survey on variational characterizations for nonlinear eigenvalue problems | |
Li et al. | A parallel structured banded DC algorithm for symmetric eigenvalue problems | |
Sapp et al. | Randomized algorithms for low rank matrix decomposition | |
Horváth et al. | Heuristic representation optimization for efficient generation of PH-distributed random variates | |
Hashemi et al. | On the spectral problem for trivariate functions | |
Belhaj et al. | A fast method for solving a block tridiagonal quasi-Toeplitz linear system | |
Okša et al. | Asymptotic quadratic convergence of the parallel block-Jacobi EVD algorithm with dynamic ordering for Hermitian matrices |