[go: up one dir, main page]

Börm, 2008 - Google Patents

Adaptive variable-rank approximation of general dense matrices

Bö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 …
Continue reading at ricamwww.ricam.oeaw.ac.at (PDF) (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/14Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141Discrete Fourier transforms
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/11Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/16Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods 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/52Multiplying; Dividing
    • G06F7/523Multiplying only
    • G06F7/53Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60Methods 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/72Methods 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/724Finite field arithmetic
    • G06F7/726Inversion; Reciprocal calculation; Division of elements of a finite field
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computer systems based on biological models
    • G06N3/02Computer systems based on biological models using neural network models
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06KRECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62Methods or arrangements for recognition using electronic means
    • G06K9/6217Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06KRECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/36Image preprocessing, i.e. processing the image information without deciding about the identity of the image
    • G06K9/46Extraction of features or characteristics of the image
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10Bioinformatics, 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