Results 171 to 180 of about 128,877 (315)
Two-Variable Wilson Polynomials and the Generic Superintegrable System on the 3-Sphere
We show that the symmetry operators for the quantum superintegrable system on the 3-sphere with generic 4-parameter potential form a closed quadratic algebra with 6 linearly independent generators that closes at order 6 (as differential operators ...
Ernie G. Kalnins+2 more
doaj +1 more source
Home‐Based Care Outcomes: Does the Care Provider Matter?
ABSTRACT Long‐term services in the home are predominately provided by family or friends, with a growing proportion of individuals receiving formal care, or paid care by a professional, or a combination of both. However, the relative benefits to the care recipient of who provides the care are largely unknown.
Norma B. Coe+4 more
wiley +1 more source
Zeros of orthogonal polynomials in certain discrete Sobolev spaces
Sangsoo Han+2 more
openalex +1 more source
The Reproducing Kernel Structure Arising from a Combination of Continuous and Discrete Orthogonal Polynomials into Fourier Systems [PDF]
Luís Daniel Abreu
openalex +1 more source
Asymptotic expansion of $\beta $ matrix models in the multi-cut regime
We establish the asymptotic expansion in $\beta $ matrix models with a confining, off-critical potential in the regime where the support of the equilibrium measure is a finite union of segments.
Gaëtan Borot, Alice Guionnet
doaj +1 more source
ABSTRACT The present study develops a finite element‐based numerical method for simulation of frictional rotational sliding induced damage and heating effects on rock. The method is applied to the Sievers’ J‐ miniature drill test, which is widely used for estimating the rock drillability and predicting the cutter life.
Timo Saksala+8 more
wiley +1 more source
Preud's equations for orthogonal polynomials as discrete Painlevé equations
Alphonse Magnus
openalex +2 more sources
ABSTRACT We propose an algorithm to solve optimization problems constrained by ordinary or partial differential equations under uncertainty, with additional almost sure inequality constraints on the state variable. To alleviate the computational burden of high‐dimensional random variables, we approximate all random fields by the tensor‐train (TT ...
Harbir Antil+2 more
wiley +1 more source
G. Curbera, A. J. Durán
semanticscholar +1 more source
Structured Nuclear Norm Matrix Completion: Guaranteeing Exact Recovery via Block‐Column Scaling
ABSTRACT The goal of low‐rank matrix completion is to minimize the rank of a matrix while adhering to the constraint that known (non‐missing) elements are fixed in the approximation. Minimizing rank is a difficult, non‐convex, NP‐hard problem, often addressed by substituting rank with the nuclear norm to achieve a convex relaxation.
Konstantin Usevich+3 more
wiley +1 more source