Results 251 to 260 of about 822,442 (292)

Inf-sup stable space-time Local Discontinuous Galerkin method for the heat equation. [PDF]

J Sci Comput
Gómez S, Perinati C, Stocker P.
europepmc   +1 more source

High-Resolution CSRR-Based Microwave Sensor for Soil Moisture Content Monitoring. [PDF]

Sensors (Basel)
Alduwish S, Li Y, Scott J, Hourani A, Mahmood N.   +4 more
europepmc   +1 more source

The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]

Theory Comput Syst
van Heuven van Staereling I, de Keijzer B, Schäfer G.   +2 more
europepmc   +1 more source

Fast and Accurate GPU-Accelerated Computation of Two-Electron Four-Center Coulomb Repulsion Integrals. [PDF]

J Comput Chem
Kaur A, Chen W, Luhana GK, Silberman L, Ewert M, Bünger A, Segal U, Greif C.   +7 more
europepmc   +1 more source

Extending homomorphic algorithms for encrypted text comparison. [PDF]

Sci Rep
Seco-Aguirre I, Regueiro C, Bernabé-Rodríguez J, Jacob E.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Simultaneous Polynomial Approximation

SIAM Journal on Mathematical Analysis, 1993
The authors prove the approximation theorem on simultaneous approximation of \(f\in C^ s[- 1,1]\) and its derivatives of order \(j\), \(0\leq j\leq s\), by polynomials of degree \(n\) and their derivatives which has filled the gap between Timan-Trigub's type theorem and the classical norm estimate of the Jackson type.
D Leviatan, Z Ditzian
exaly   +3 more sources

Approximate Polynomial GCD by Approximate Syzygies

Mathematics in Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Approximate polynomial decomposition

Proceedings of the 1999 international symposium on Symbolic and algebraic computation, 1999
where deg g < deg f , deg h < deg f , deg∆f ≤ deg f and ∆f is “small” with respect to the 2-norm of the vector of coefficients. In practice if ‖f‖ denotes the 2-norm of f , then we compute g and h such that ‖∆f‖ is a local minimum with respect to variations in g and h.
Robert M. Corless, Mark Giesbrecht, David J. Jeffrey, Stephen M. Watt   +3 more
openaire   +1 more source

Approximation Numbers for Polynomials

2019
Approximation numbers of linear operators are a very useful tool in order to understand the structure and the numerical behaviour of the operators. In this paper, this concept is extended to polynomials on Banach spaces and the approximation numbers of diagonal polynomials are estimated.
Junek, Heinz, Braunß, Hans-Andreas, Plewnia, Eckart   +2 more
openaire   +2 more sources

Rigorous Polynomial Approximation

2018 52nd Asilomar Conference on Signals, Systems, and Computers, 2018
Polynomial approximation is a key to implementation of transcendental functions $f: \mathrm{R}\rightarrow \mathrm{R}$, such as $\exp, \log, \sin$. All existing approaches to polynomial approximation are based on a posteriori control of the error made during the approximation process with floating-point numbers F.We perform polynomial interpolation with
openaire   +2 more sources