Börm, 2008 - Google Patents
Adaptive variable-rank approximation of general dense matricesBörm, 2008
View PDF- Document ID
- 6583269981951152899
- Author
- Börm S
- Publication year
- Publication venue
- SIAM journal on scientific computing
External Links
Snippet
In order to handle large dense matrices arising in the context of integral equations efficiently, panel-clustering approaches (such as the popular multipole expansion method) have proven to be very useful. These techniques split the matrix into blocks, approximate the …
- 230000003044 adaptive 0 title description 13
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/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
-
- 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
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
-
- 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
-
- 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
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
-
- 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/36—Image preprocessing, i.e. processing the image information without deciding about the identity of the image
- G06K9/46—Extraction of features or characteristics of the image
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Polizzi et al. | SPIKE: A parallel environment for solving banded linear systems | |
| Colangelo et al. | Exploration of low numeric precision deep learning inference using intel® fpgas | |
| Jin | Developments and applications of block Toeplitz iterative solvers | |
| Joux et al. | Cover and Decomposition Index Calculus on Elliptic Curves Made Practical: Application to a Previously Unreachable Curve over | |
| JP7776153B2 (en) | Systems and methods for accelerating training of deep learning networks | |
| JP2023026751A (en) | System, computer-implemented method and computer program (efficient convolution in environment that enforces tiles) | |
| Van Der Hoeven et al. | On the complexity of multivariate blockwise polynomial multiplication | |
| Bank et al. | An algebraic multilevel multigraph algorithm | |
| Tamada et al. | Parallel algorithm for learning optimal Bayesian network structure | |
| Börm | Construction of data-sparse H^2-matrices by hierarchical compression | |
| Ha et al. | Resource analysis of quantum computing with noisy qubits for Shor’s factoring algorithms | |
| Schindler et al. | Generic power attacks on RSA with CRT and exponent blinding: new results | |
| Yuan et al. | QEGCN: An FPGA-based accelerator for quantized GCNs with edge-level parallelism | |
| Börm | Adaptive variable-rank approximation of general dense matrices | |
| Al-Dolat et al. | General numerical radius inequalities for matrices of operators | |
| Ballard et al. | Minimizing communication for eigenproblems and the singular value decomposition | |
| Börm | Data-sparse approximation of non-local operators by H2-matrices | |
| Taylor | The Iwasawa decomposition and the limiting behavior of Brownian motion on a symmetric space of non-compact type | |
| Amini et al. | Analysis of a diagonal form of the fast multipole algorithm for scattering theory | |
| Gudmundsson et al. | Improved greedy algorithms for constructing sparse geometric spanners | |
| Ford et al. | Matrix approximations and solvers using tensor products and non-standard wavelet transforms related to irregular grids. | |
| Wilkening et al. | A local construction of the Smith normal form of a matrix polynomial | |
| Treister et al. | On-the-fly adaptive smoothed aggregation multigrid for Markov chains | |
| Valev et al. | A method of solving pattern or image recognition problems by learning Boolean formulas | |
| Kudo et al. | Efficient Search for Superspecial Hyperelliptic Curves of Genus Four with Automorphism Group Containing C 6 |