Related papers: On the logarithmic energy of solutions to the poly…
The present contribution concerns the computation of energy eigenvalues of a perturbed anharmonic coulombic potential with irregular singularities using a combination of the Sinc collocation method and the double exponential transformation.…
The expected root-mean-square value of a matrix element $A_{\alpha\beta}$ in a classically chaotic system, where $A$ is a smooth, $\hbar$-independent function of the coordinates and momenta, and $\alpha$ and $\beta$ label different energy…
We consider a class of wave equations of the type $\partial_{tt} u + Lu + B\partial_{t} u = 0$, with a self-adjoint operator $L$, and various types of local damping represented by $B$. By establishing appropriate and raher precise estimates…
In this short note, we employ well-known results to improve the lower bound for the constant associated with the linear term in the asymptotic expansion of the minimal logarithmic energy on the sphere.
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
The 17th of the problems proposed by Steve Smale for the 21st century asks for the existence of a deterministic algorithm computing an approximate solution of a system of $n$ complex polynomials in $n$ unknowns in time polynomial, on the…
We present a perturbed subspace iteration algorithm to approximate the lowermost eigenvalue cluster of an elliptic eigenvalue problem. As a prototype, we consider the Laplace eigenvalue problem posed in a polygonal domain. The algorithm is…
Bound states of the power-law and logarithmic potentials are calculated using a generalized pseudospectral method. The solution of the single-particle Schr\"odinger equation in a nonuniform and optimal spatial discretization offers accurate…
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems with common $2\times 2$ block structure. It is assumed that the upper diagonal block varies between different versions while the lower…
We examine the energy function with respect to the zeros of exceptional Hermite polynomials. The localization of the eigenvalues of the Hessian is given in the general case. In some special arrangements we have a more precise result on the…
We prove local energy decay estimates for solutions to the inhomogeneous Maxwell system on a generic class of spherically symmetric black holes.
The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pad\'e approximation, sometimes accompanied by the Schur decomposition. The main computational…
We treat the eigenvalue problem posed by self-similar potentials, i.e. homogeneous functions under a particular affine transformation, by means of symmetry techniques. We find that the eigenfunctions of such problems are localized, even…
We describe two algorithms for the eigenvalue, eigenvector problem which, on input a Gaussian matrix with complex entries, finish with probability 1 and in average polynomial time.
This work identifies a solvable (in the sense that spectral correlation functions can be expressed in terms of orthogonal polynomials), rotationally invariant random matrix ensemble with a logarithmic weakly confining potential. The…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We consider minimum energy optimal control problem with time dependent Lagrangian on the nonholonomic integrator and and find the analytical solution using Sturm-Liouville theory. Furthermore, we also consider the minimum energy problem on…
We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as…
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…