Results 1  10
of
116,401
Vectororthogonality and Lanczostype methods
, 2000
"... A method for solving a linear system is defined. It is a Lanczostype method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. ..."
Abstract
 Add to MetaCart
A method for solving a linear system is defined. It is a Lanczostype method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems
On Lanczostype methods for Wilson fermions
"... . Numerical simulations of lattice gauge theories with fermions rely heavily on the iterative solution of huge sparse linear systems of equations. Due to short recurrences, which mean small memory requirement, Lanczostype methods (including suitable versions of the conjugate gradient method when ap ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. Numerical simulations of lattice gauge theories with fermions rely heavily on the iterative solution of huge sparse linear systems of equations. Due to short recurrences, which mean small memory requirement, Lanczostype methods (including suitable versions of the conjugate gradient method when
A Lanczostype method for multiple starting vectors
 MATH. COMP
, 2000
"... Given a square matrix and single right and left starting vectors, the classical nonsymmetric Lanczos process generates two sequences of biorthogonal basis vectors for the right and left Krylov subspaces induced by the given matrix and vectors. In this paper, we propose a Lanczostype algorithm that ..."
Abstract

Cited by 54 (15 self)
 Add to MetaCart
procedure to detect and delete linearly dependent vectors in the block Krylov sequences, and the option to employ lookahead to remedy the potential breakdowns that may occur in nonsymmetric Lanczostype methods.
TransposeFree Formulations Of LanczosType Methods For Nonsymmetric Linear Systems
"... . We present a transposefree version of the nonsymmetric scaled Lanczos procedure. It generates the same tridiagonal matrix as the classical algorithm, using two matrixvector products per iteration without accessing A T . We apply this algorithm to obtain a transposefree version of the QuasiMi ..."
Abstract
 Add to MetaCart
Minimal Residual method of Freund and Nachtigal [11] (without lookahead), which requires three matrixvector products per iteration. We also present a related transposefree version of the BiConjugate Gradients algorithm. Keywords: Lanczos algorithm, QuasiMinimal Residual algorithm, BiConjugate Gradients
Formal orthogonal polynomials for an arbitrary moment matrix and Lanczos type methods
, 1994
"... We give a framework for formal orthogonal polynomials with respect to an arbitrary moment matrix. When the moment matrix is Hankel, this simplies to the classical framework. The relation with Pade approximation and with Krylov subspace methods is given. 1 Formal block orthogonal polynomials We cons ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give a framework for formal orthogonal polynomials with respect to an arbitrary moment matrix. When the moment matrix is Hankel, this simplies to the classical framework. The relation with Pade approximation and with Krylov subspace methods is given. 1 Formal block orthogonal polynomials We
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 624 (12 self)
 Add to MetaCart
that solves the optimization problem in polynomial time for a large class of problems. The proposed method has important applications in areas such as computational biology, natural language processing, information retrieval/extraction, and optical character recognition. Experiments from various domains
An iterative method for the solution of the eigenvalue problem of linear differential and integral
, 1950
"... The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the ..."
Abstract

Cited by 537 (0 self)
 Add to MetaCart
the process of "minimized iterations". Moreover, the method leads to a well convergent successive approximation procedure by which the solution of integral equations of the Fredholm type and the solution of the eigenvalue problem of linear differential and integral operators may be accomplished. I.
The R*tree: an efficient and robust access method for points and rectangles
 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1990
"... The Rtree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract

Cited by 1262 (74 self)
 Add to MetaCart
The Rtree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design
Suffix arrays: A new method for online string searches
, 1991
"... A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract

Cited by 835 (0 self)
 Add to MetaCart
is that, in practice, they use three to five times less space. From a complexity standpoint, suffix arrays permit online string searches of the type, "Is W a substring of A?" to be answered in time O(P + log N), where P is the length of W and N is the length of A, which is competitive with (and
Results 1  10
of
116,401