相关论文: Vandermonde with Arnoldi

The non-orthogonality of algebraic polynomials of field coordinates traditionally used to model field-dependent corrections to astrometric measurements, gives rise to subtle adverse effects. In particular, certain field dependent…

Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices…

The two-matrix model can be solved by introducing bi-orthogonal polynomials. In the case the potentials in the measure are polynomials, finite sequences of bi-orthogonal polynomials (called "windows") satisfy polynomial ODEs as well as…

In this work, a new approach has been developed to obtain numerical solution of linear Volterra type integral equations by obtaining asymptotic approximation to solutions. Using the classical Bernoulli polynomials, a set of orthonormal…

In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…

In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce black-box multivariate…

We present a derivation of classical Hermite, Laguerre, and Jacobi orthogonal polynomials directly through the Gram-Schmidt orthogonization process. The derivation uses certain generalized Vandermonde determinants with entries defined by…

Conditional Gradient algorithms (aka Frank-Wolfe algorithms) form a classical set of methods for constrained smooth convex minimization due to their simplicity, the absence of projection steps, and competitive numerical performance. While…

A new technique is presented to solve a class of linear boundary value problems (BVP). Technique is primarily based on an operational matrix developed from a set of modified Bernoulli polynomials. The new set of polynomials is an…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

One approach to parametric and adaptive model reduction is via the interpolation of orthogonal bases, subspaces or positive definite system matrices. In all these cases, the sampled inputs stem from matrix sets that feature a geometric…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

This work investigates a new approach to find closed form analytical approximate solution of linear initial value problems. Classical Bernoulli polynomials have been used to derive a finite set of orthonormal polynomials and a finite…

It is shown that the problem of balancing a nonnegative matrix by positive diagonal matrices can be recast as a constrained nonlinear multiparameter eigenvalue problem. Based on this equivalent formulation some adaptations of the power…

In 1989 we proposed to employ Vandermonde and Hankel multipliers to transform into each other the matrix structures of Toeplitz, Hankel, Vandermonde and Cauchy types as a means of extending any successful algorithm for the inversion of…

We give explicit formulas as well as a quadratic time algorithm to solve (so called) generalized Vandermonde's systems of p linear equations and n variables. It allows in particular to find all (so called Lagrange's) interpolation polynoms…

In this work, a new technique has been presented to find approximate solution of linear integro-differential equations. The method is based on modified orthonormal Bernoulli polynomials and an operational matrix thereof. The method converts…

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…

Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…

Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…