Related papers: Carleman Linearization and Systems of Arbitrary De…
Matrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited-memory methods for the approximation of the action of…
A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
We introduce a derivative-free computational framework for approximating solutions to nonlinear PDE-constrained inverse problems. The aim is to merge ideas from iterative regularization with ensemble Kalman methods from Bayesian inference…
In this note, the first-order Dickson polynomials are introduced through a particular case of the expression of the trace of the $n^{th}$ power of a matrix in terms of powers of the trace and determinant of the matrix itself. The technique…
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
Regularization method and Bayesian inverse method are two dominating ways for solving inverse problems generated from various fields, e.g., seismic exploration and medical imaging. The two methods are related with each other by the MAP…
Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…
We propose a recursive method that makes use of the basic principle of unitarity to calculate the Landau singularities of n-point scattering amplitudes directly in kinematic space. For a vast class of Feynman diagrams, the method enables…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
In this paper, we revisit implicit regularization from the ground up using notions from dynamical systems and invariant subspaces of Morse functions. The key contributions are a new criterion for implicit regularization---a leading…
A high-order quadrature scheme is constructed for the evaluation of Laplace single and double layer potentials and their normal derivatives on smooth surfaces in three dimensions. The construction begins with a harmonic approximation of the…
In this manuscript, new algebraic and analytic aspects of the orthogonal polynomials satisfying $R_{II}$ type recurrence relation given by \begin{align*} \mathcal{P}_{n+1}(x) = (x-c_n)\mathcal{P}_n(x)-\lambda_n…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
The paper is devoted to the methods of solving simultaneous recurrences. Specifically, we discuss transformation of matrix recurrences to regular recurrences and propose a way of solving special matrix recurrences of order three by their…
In this text I present a couple of new principles and thereon based iterative methods for numerical solution of sequences of systems of linear equations with fixed system matrix and changing right-hand-sides. The use of the new methods is…
This paper concerns identification of uncontrolled or closed loop nonlinear systems using a set of trajectories that are generated by the system in a domain of attraction. The objective is to ensure that the trajectories of the identified…