Related papers: Structured inversion of the Bernstein mass matrix
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
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…
In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design…
In this note, we apply kernel polynomials to find the explicit inverses for some some Hankel matrices associated with q-orthogonal polynomials.
In many field theoretical models one has to resum two- and four-legged subdiagrams in order to determine their behaviour. In this article we present a novel formalism which does this in a nice way. It is based on the central limit theorem…
We introduce the concept of reflexive moment functional in two variables and the definition of reflexive orthogonal polynomial system. Also reverse matrices and their interesting algebraic properties are studied. Reverse matrices and…
In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a finite discrete scenario set. Through studying a non-traditional bilinear mixed integer…
We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…
Using principles of the theory of smoothness spaces we give systematic constructions of scales of inverse-closed subalgebras of a given Banach algebra with the action of a d-parameter automorphism group. In particular we obtain the…
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
This paper develops matrix-multiplication-based iterative refinement for diagonalizable non-Hermitian eigendecompositions. The main theory concerns simple eigenvalues and distinguishes two input regimes. In the right-only regime, where only…
An overview is given of Bayesian inversion and regularization procedures. In particular, the conceptual basis of the maximum entropy method (MEM) is discussed, and extensions to positive/negative and complex data are highlighted. Other…
This paper discusses the explicit inverse of a class of seven-diagonal (near) Toeplitz matrices, which arises in the numerical solutions of nonlinear fourth-order differential equation with a finite difference method. A non-recurrence…
We present a fast direct solver for structured linear systems based on multilevel matrix compression. Using the recently developed interpolative decomposition of a low-rank matrix in a recursive manner, we embed an approximation of the…
We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
The Eberlein diagonalization method is an iterative Jacobi-type method for solving the eigenvalue problem of a general complex matrix. In this paper we develop the block version of the Eberlein method. We prove the global convergence of our…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
We study variational regularisation methods for inverse problems with imperfect forward operators whose errors can be modelled by order intervals in a partial order of a Banach lattice. We carry out analysis with respect to existence and…