Related papers: On Generalized Hilbert Matrices
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…
In this paper, we will investigate the jet schemes of determinantal varieties. It is quite often the case that the geometric information concerning the jet schemes of an algebraic variety can be described, but the more refined algebraic…
We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seidel iterative methods are convergent for linear systems with strictly or irreducibly diagonally dominant matrices, invertible $H-$matrices…
We present a new approach to compute selected eigenvalues and eigenvectors of the two-parameter eigenvalue problem. Our method requires computing generalized eigenvalue problems of the same size as the matrices of the initial two-parameter…
In this paper, we describe improved algorithms to compute Janet and Pommaret bases. To this end, based on the method proposed by Moller et al., we present a more efficient variant of Gerdt's algorithm (than the algorithm presented by…
In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the…
The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…
For any orthogonal polynomials system on real line we construct an appropriate oscillator algebra such that the polynomials make up the eigenfunctions system of the oscillator hamiltonian. The general scheme is divided into two types: a…
The Cayley-Hamilton problem of expressing functions of matrices in terms of only their eigenvalues is well-known to simplify to finding the inverse of the confluent Vandermonde matrix. Here, we give a highly compact formula for the inverse…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
In this paper, closed formulas for the eigenvectors of a particular class of matrices generated by generalized permutation matrices, named generalized circulant matrices, are presented.
We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…
The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation…
This paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse…
This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…