English
Related papers

Related papers: Rational approximation to the Thomas--Fermi equati…

200 papers

The two-parameter Mittag-Leffler function $E_{\alpha, \beta}$ is of fundamental importance in fractional calculus. It appears frequently in the solutions of fractional differential and integral equations. Nonetheless, this vital function is…

Numerical Analysis · Mathematics 2023-12-13 Aljowhara H. Honain , Khaled M. Furati , Ibrahim O. Sarumi , Abdul Q. M. Khaliq

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

Numerical Analysis · Mathematics 2021-01-11 William Gerst

The Chisholm rational approximant is a natural generalization to two variables of the well-known single variable Pad\'e approximant, and has the advantage of reducing to the latter when one of the variables is set equals to 0. We present,…

Mathematical Software · Computer Science 2023-09-15 Souvik Bera , Tanay Pathak

We have looked at the evaluation of the Riemann Zeta function at odd arguments and have provided a simple formula to approximate the value with exponential convergence. We have compared it with various other formulae present in literature.…

Number Theory · Mathematics 2015-03-19 Srinivasan Arunachalam

We introduce a class of real algebraic varieties characterised by a simple rationality condition, which exhibit strong properties regarding approximation of continuous and smooth mappings by regular ones. They form a natural counterpart to…

Algebraic Geometry · Mathematics 2024-12-31 Juliusz Banecki

Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…

Optimization and Control · Mathematics 2022-07-05 Christian Kanzow , Patrick Mehlitz

A new and simple method for quasi-convex optimization is introduced from which its various applications can be derived. Especially, a global optimum under constrains can be approximated for all continuous functions.

Optimization and Control · Mathematics 2020-12-07 Sompong Dhompongsa , Poom Kumam

In the article we propose a general scheme for solutions of some approximation problems under a rather general setting. We illustrate the application of the proposed scheme by a series of examples, in particular we show that many results in…

Functional Analysis · Mathematics 2023-12-29 Oleg Kovalenko

We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty…

Optimization and Control · Mathematics 2017-10-19 Achintya Kundu , Francis Bach , Chiranjib Bhattacharyya

In this paper we consider a mathematical model which describes the equilibrium of two elastic rods attached to a nonlinear spring. We derive the variational formulation of the model which is in the form of an elliptic quasivariational…

Numerical Analysis · Mathematics 2023-09-11 Anna Ochal , Wiktor Prządka , Mircea Sofonea , Domingo A. Tarzia

Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…

Numerical Analysis · Mathematics 2024-07-30 Nicolas Boullé , Astrid Herremans , Daan Huybrechs

In this note we prove the optimality of a family of known coincidence theorems for absolutely summing multilinear operators. We connect our results with the theory of multiple summing multilinear operators and prove the sharpness of similar…

Functional Analysis · Mathematics 2015-10-06 Daniel Pellegrino

In this paper we present a short and elementary proof for the error in Simpson's rule.

General Mathematics · Mathematics 2017-08-28 Hajrudin Fejzic

We study point symmetries of the Robinson--Trautman equation. The cases of one- and two-dimensional algebras of infinitesimal symmetries are discussed in detail. The corresponding symmetry reductions of the equation are given. Higher…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Wlodzimierz Natorf , Jacek Tafel

We prove a lower bound that agrees with Manin's prediction for the number of rational points of bounded height on the Fermat cubic surface. As an application we provide a simple counterexample to Manin's conjecture over the rationals.

Number Theory · Mathematics 2014-02-04 Efthymios Sofos

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…

Numerical Analysis · Mathematics 2012-07-17 Erwan Faou , Fabio Nobile , Christophe Vuillot

It is shown that quadrature formulas in many different applications can be derived from rational approximation of the Cauchy transform of a weight function. Since rational approximation is now a routine technology, this provides an easy new…

Numerical Analysis · Mathematics 2025-07-22 Andrew Horning , Lloyd N. Trefethen

The pure traction problem of elasticity appears frequently in engineering applications, and its complexity stems from the fact that its solution is unique only up to (infinitesimal) rigid body motions. When finite elements are employed to…

Numerical Analysis · Mathematics 2026-02-05 Ahsan Kaleem , Cristian Gebhardt , Ignacio Romero

In the present article, we study the numerical approximation of a system of Hamilton-Jacobi and transport equations arising in geometrical optics. We consider a semi-Lagrangian scheme. We prove the well posedness of the discrete problem and…

Analysis of PDEs · Mathematics 2011-10-20 Yves Achdou , Fabio Camilli , Lucilla Corrias

We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both on real-life preference-aggregation data and on synthetic…

Multiagent Systems · Computer Science 2013-01-29 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko
‹ Prev 1 8 9 10 Next ›