Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...
Polyanalytic function theory extends the classical theory of holomorphic functions by encompassing functions that satisfy higher‐order generalisations of the Cauchy–Riemann equations. This broader ...
Abstract: Polynomial Lyapunov function $\mathcal{V}({\mathbf{x}})$ provides mathematically rigorous that converts stability analysis into efficiently solvable optimization problem. Traditional ...
Mathematics of Computation, Vol. 34, No. 150 (Apr., 1980), pp. 441-463 (23 pages) Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are ...
This repository contains Python code for performing polynomial regression using gradient descent, implemented with PyTorch, as required for Assignment 1. The code provides functions for polynomial ...
ABSTRACT: Starting from general Jacobi polynomials we derive for the Ul-traspherical polynomials as their special case a set of related polynomials which can be extended to an orthogonal set of ...
Abstract: Embedded applications use more and more sophisticated computations. These computations can integrate the composition of elementary functions which have to be approximated. In the context of ...
A three-complex-parameter class of orthogonal Laurent polynomials on the unit circle associated with basic hypergeometric or q-hypergeometric functions is considered. To be precise, we consider the ...
MYPATH:="{path to the code}/": SLV_PATH:=cat(MYPATH,"SLV/"): read cat(MYPATH, "Milne.mpl"): read cat(SLV_PATH, "SLV.mpl"): h1:=2*x^2+3*x*y+y^2-3: h2:=4*x^2+7*y^2+9*y ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback