Related papers: Inverse Inequality Estimates with Symbolic Computa…
In the last ten years, the employment of symbolic methods has substantially extended both the theory and the applications of statistics and probability. This survey reviews the development of a symbolic technique arising from classical…
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…
We propose in this work a subgradient extragradient method with inertial and correction terms for solving equilibrium problems in a real Hilbert space. We obtain that the sequence generated by our proposed method converges weakly to a point…
The first step when solving an infinite-dimensional eigenvalue problem is often to discretize it. We show that one must be extremely careful when discretizing nonlinear eigenvalue problems. Using examples, we show that discretization can:…
In recent years, neuro-symbolic methods have become a popular and powerful approach that augments artificial intelligence systems with the capability to perform abstract, logical, and quantitative deductions with enhanced precision and…
The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…
The problem of the determination of the Hilbert-space metric which renders a given Hamiltonian $H$ self-adjoint is addressed from the point of view of applicability of computer-assisted algebraic manipulations. An exactly solvable example…
A new class of high-order maximum principle preserving numerical methods is proposed for solving parabolic equations, with application to the semilinear Allen--Cahn equation. The proposed method consists of a $k$th-order multistep…
Hyperbolic problems can at times be solved employing symbolic arguments. This is especially true for the construction of forward (and backward) fundamental solutions. We formulate a corresponding abstract scheme and illustrate its…
Quantum algorithms for estimating the eigenvalues of matrices, including the phase estimation algorithm, serve as core subroutines in a wide range of quantum algorithms, including those in quantum chemistry and quantum machine learning. The…
Efficient solvers for tensor eigenvalue problems are important tools for the analysis of higher-order data sets. Here we introduce, analyze and demonstrate an extrapolation method to accelerate the widely used shifted symmetric higher order…
In this paper, we propose a new finite element approach, which is different than the classic Babuska-Osborn theory, to approximate Dirichlet eigenvalues. The Dirichlet eigenvalue problem is formulated as the eigenvalue problem of a…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
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…
For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is…
This paper presents a symbolic computation method for automatically transforming $q$-hypergeometric identities to $q$-binomial identities. Through this method, many previously proven $q$-binomial identities, including $q$-Saalsch\"utz's…
We consider the minimization or maximization of the $J$th largest eigenvalue of an analytic and Hermitian matrix-valued function, and build on Mengi et al. (2014, SIAM J. Matrix Anal. Appl., 35, 699-724). This work addresses the setting…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
A multilevel correction scheme is proposed to solve defective and nodefective of nonsymmetric partial differential operators by the finite element method. The method includes multi correction steps in a sequence of finite element spaces. In…