English
Related papers

Related papers: Semi-analytical solutions for eigenvalue problems …

200 papers

Consider the following truncated Freud linear functional $\mathbf{u}_z$ depending on a parameter $z$, $$\langle\mathbf{u}_z,p\rangle=\int_0^\infty p(x)e^{-zx^4}dx,\quad z>0.$$ The aim of this work is to analyze the properties of the…

Classical Analysis and ODEs · Mathematics 2025-10-13 Juan Carlos García-Ardila , Francisco Marcellán , Misael E. Marriaga

In this paper, we discuss numerical approximation of the eigenvalues of the one-dimensional radial Schr\"{o}dinger equation posed on a semi-infinite interval. The original problem is first transformed to one defined on a finite domain by…

Numerical Analysis · Mathematics 2024-03-19 Lidia Aceto , Cecilia Magherini , Ewa B. Weinmüller

We generalize the seminal polynomial partitioning theorems of Guth and Katz to a set of semi-Pfaffian sets. Specifically, given a set $\Gamma \subseteq \mathbb{R}^n$ of $k$-dimensional semi-Pfaffian sets, where each $\gamma \in \Gamma$ is…

Logic · Mathematics 2026-01-19 Martin Lotz , Abhiram Natarajan , Nicolai Vorobjov

Let P(z) and Q(y) be polynomials of the same degree k>=1 in the complex variables z and y, respectively. In this extended abstract we study the non-linear functional equation P(z)=Q(y(z)), where y(z) is restricted to be analytic in a…

Complex Variables · Mathematics 2007-06-13 Manuel Lladser

Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For $\alpha \leq 1$ and $k \in \mathbb{Z}^+$, we say that a graph $G=(V,E)$ is…

Data Structures and Algorithms · Computer Science 2019-09-02 Suprovat Ghoshal , Anand Louis , Rahul Raychaudhury

Feedback control problems involving autonomous polynomial systems are prevalent, yet there are limited algorithms and software for approximating their solution. This paper represents a step forward by considering the special case of the…

Optimization and Control · Mathematics 2020-09-24 Jeff Borggaard , Lizette Zietsman

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…

Numerical Analysis · Mathematics 2025-02-21 Michiel E. Hochstenbach , Christian Mehl , Bor Plestenjak

It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…

Classical Analysis and ODEs · Mathematics 2016-09-06 Antonio J. Durán , Walter Van Assche

In this article, we study numerical approximation of eigenvalue problems of the Schr\"{o}dinger operator $\displaystyle -\Delta u + \frac{c^2}{|x|^2}u$. There are three stages in our investigation: We start from a ball of any dimension, in…

Numerical Analysis · Mathematics 2016-06-22 Huiyuan Li , Zhimin Zhang

Let $(P_n(x;z;\lambda))_{n\geq 0}$ be the sequence of monic orthogonal polynomials with respect to the symmetric linear functional $\mathbf{s}$ defined by $$\langle\mathbf{s},p\rangle=\int_{-1}^1 p(x)(1-x^2)^{(\lambda-1/2)}…

Classical Analysis and ODEs · Mathematics 2024-02-01 Juan C. García-Ardila , Francisco Marcellán

The study of polynomial solutions to the classical Lam\'e equation in its algebraic form, or equivalently, of double-periodic solutions of its Weierstrass form has a long history. Such solutions appear at integer values of the spectral…

Classical Analysis and ODEs · Mathematics 2009-11-13 Julius Borcea , Boris Shapiro

Diaconis and Griffiths (2014) study the multivariate Krawtchouk polynomials orthogonal on the multinomial distribution. In this paper we derive the reproducing kernel orthogonal polynomials Q_n(x,y};N,p) on the multinomial distribution…

Probability · Mathematics 2019-02-06 Persi Diaconis , Robert Griffiths

We study monic polynomials $Q_n(x)$ generated by a high order three-term recursion $xQ_n(x)=Q_{n+1}(x)+a_{n-p} Q_{n-p}(x)$ with arbitrary $p\geq 1$ and $a_n>0$ for all $n$. The recursion is encoded by a two-diagonal Hessenberg operator $H$.…

Classical Analysis and ODEs · Mathematics 2023-08-30 Steven Delvaux , Abey López García

In a recent study of the quantum theory of harmonic oscillators, Gerard 't Hooft proposed the following problem: given $G(z)=\sum_{n=1}^\infty\sqrt{n}\,z^n$ for $|z|<1$, find its analytic continuation for $|z|\ge1$, excluding a branch-cut…

Number Theory · Mathematics 2025-10-14 David Broadhurst , Gergő Nemes

We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…

Data Structures and Algorithms · Computer Science 2022-07-25 Rajarshi Bhattacharjee , Gregory Dexter , Petros Drineas , Cameron Musco , Archan Ray

We revisit the $k$-Hessian eigenvalue problem on a smooth, bounded, $(k-1)$-convex domain in $\mathbb R^n$. First, we obtain a spectral characterization of the $k$-Hessian eigenvalue as the infimum of the first eigenvalues of linear…

Analysis of PDEs · Mathematics 2021-09-28 Nam Q. Le

The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue problem for a pencil of Hessenberg matrices. Two procedures are…

Numerical Analysis · Mathematics 2021-05-24 Niel Van Buggenhout , Marc Van Barel , Raf Vandebril

Recurrence coefficients of semi-classical orthogonal polynomials (orthogonal polynomials related to a weight function $w$ such that $w'/w$ is a rational function) are shown to be solutions of non linear differential equations with respect…

Classical Analysis and ODEs · Mathematics 2016-09-06 Alphonse P. Magnus

In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…

Numerical Analysis · Mathematics 2016-08-24 Fatima Aboud , Francois Jauberteau , Guy Moebs , Didier Robert

We study partial and budgeted versions of the well studied connected dominating set problem. In the partial connected dominating set problem, we are given an undirected graph G = (V,E) and an integer n', and the goal is to find a minimum…

Data Structures and Algorithms · Computer Science 2013-11-12 Samir Khuller , Manish Purohit , Kanthi Sarpatwar