Related papers: Generalized eigenvalue methods for Gaussian quadra…
We consider eigenvalue condition numbers and backward errors for a class of symmetric nonlinear eigenvalue problems with eigenvector nonlinearities. For both of these quantities, we derive explicit and computable expressions that can be…
Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs…
In covariance matrix estimation, one of the challenges lies in finding a suitable model and an efficient estimation method. Two commonly used modelling approaches in the literature involve imposing linear restrictions on the covariance…
We study quantum integrable models solvable by the nested algebraic Bethe ansatz and possessing $\mathfrak{gl}(m|n)$-invariant $R$-matrix. We compute the norm of the Hamiltonian eigenstates. Using the notion of a generalized model we show…
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…
In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…
We study the effects of numerical quadrature rules on error convergence rates when solving Maxwell-type variational problems via the curl-conforming or edge finite element method. A complete {\em a priori} error analysis for the case of…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
A new approach which generalizes the Selective Modal Analyis (SMA) and algorithms based upon it for solving the generalized eigenvalue problem is described. This approach allows for the systematic consideration of physical properties of the…
We discuss the approximation of the eigensolutions associated with the Maxwell eigenvalues problem in the framework of least-squares finite elements. We write the Maxwell curl curl equation as a system of two first order equation and design…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
Neural Networks have been widely used to solve Partial Differential Equations. These methods require to approximate definite integrals using quadrature rules. Here, we illustrate via 1D numerical examples the quadrature problems that may…
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…
We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…
Data-driven control of nonlinear systems with rigorous guarantees is a challenging problem as it usually calls for nonconvex optimization and requires often knowledge of the true basis functions of the system dynamics. To tackle these…
We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…
In two and three dimensions, we analyze a finite element method to approximate the solutions of an eigenvalue problem arising from neutron transport. We derive the eigenvalue problem of interest, which results to be non-symmetric. Under a…
This paper presents an innovative set of tools developed to support a methodology to find the left eigenvalues of $m$ order quaternion square matrix. It is solving four real polynomial equations of order not greater than $4m-3$ in four…