Related papers: Confluent Vandermonde with Arnoldi
First-order methods are often analyzed via their continuous-time models, where their worst-case convergence properties are usually approached via Lyapunov functions. In this work, we provide a systematic and principled approach to find and…
A high order time stepping applied to spatial discretizations provided by the method of lines for hyperbolic conservations laws is presented. This procedure is related to the one proposed in Qiu and Shu (SIAM J Sci Comput 24(6):2185-2198,…
We propose a family of optimization methods that achieve linear convergence using first-order gradient information and constant step sizes on a class of convex functions much larger than the smooth and strongly convex ones. This larger…
The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion under the transportation…
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 this paper, we present a generalization of a Hamilton--Jacobi theory to higher order implicit differential equations. We propose two different backgrounds to deal with higher order implicit Lagrangian theories: the Ostrogradsky approach…
We obtain strong converse inequalities for the Bernstein operators with explicit constants. One of the main ingredients in our approach is the representation of the derivatives of the Bernstein operators in terms of the orthogonal…
It is well-known that every convex function admits an affine support at every interior point of a domain. Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree…
Many problems in physics, chemistry and other fields are perturbative in nature, i.e. differ only slightly from related problems with known solutions. Prominent among these is the eigenvalue perturbation problem, wherein one seeks the…
A novel orthogonalization-free method together with two specific algorithms are proposed to solve extreme eigenvalue problems. On top of gradient-based algorithms, the proposed algorithms modify the multi-column gradient such that earlier…
For a matrix ${\bf A}$ with linearly independent columns, this work studies to use its normalization $\bar{\bf A}$ and ${\bf A}$ itself to approximate its orthonormalization $\bf V$. We theoretically analyze the order of the approximation…
The Nevanlinna matrix of a half-line Jacobi operator coincides, up to multiplication with a constant matrix, with the monodromy matrix of an associated canonical system. This canonical system is discrete in a certain sense, and is…
We prove that for almost square tensor product grids and certain sets of bivariate polynomials the Vandermonde determinant can be factored into a product of univariate Vandermonde determinants. This result generalizes the conjecture [Lemma…
We present a method for the numerical calculation of derivatives of functions of general complex matrices. The method can be used in combination with any algorithm that evaluates or approximates the desired matrix function, in particular…
Global instability analysis of flows is often performed via time-stepping methods, based on the Arnoldi algorithm. When setting up these methods, several computational parameters must be chosen, which affect intrinsic errors of the…
Pendry and MacKinnon meaningful discretization of Maxwell's equations was put forward specifically as part of a finite-element numerical algorithm. By contrast with a numerical approach, in the same spirit evoked by the relationships…
The overlap operator in lattice QCD requires the computation of the sign function of a matrix, which is non-Hermitian in the presence of a quark chemical potential. In previous work we introduced an Arnoldi-based Krylov subspace…
In this work derivations of definite integrals listed in Prudnikov volume I, Gradshteyn and Ryzhik and a few other tables are produced. Special cases of these integrals in terms of fundamental constants are also evaluated. The method used…
We present randomized algorithms based on block Krylov space method for estimating the trace and log-determinant of Hermitian positive semi-definite matrices. Using the properties of Chebyshev polynomial and Gaussian random matrix, we…
We consider the Vlasov-Poisson equation in a Hamiltonian framework and derive new time splitting methods based on the decomposition of the Hamiltonian functional between the kinetic and electric energy. Assuming smoothness of the solutions,…