Results 11 to 20 of about 173,742,459 (298)

Approximation order and approximate sum rules in subdivision [PDF]

open access: yesJournal of Approximation Theory, 2016
Several properties of stationary subdivision schemes are nowadays well understood. In particular, it is known that the polynomial generation and reproduction capability of a stationary subdivision scheme is strongly connected with sum rules, its convergence, smoothness and approximation order.
CONTI, COSTANZA   +2 more
core   +8 more sources

Dispersive properties of high order nedelec/edge element approximation of the time-harmonic Maxwell equations [PDF]

open access: yes, 2004
The dispersive behaviour of high-order Næ#169;dæ#169;lec element approximation of the time harmonic Maxwell equations at a prescribed temporal frequency ω on tensor-product meshes of size h is analysed.
Ainsworth, Mark
core   +4 more sources

On the Approximation Ratio of Ordered Parsings [PDF]

open access: yesIEEE Transactions on Information Theory, 2021
Shannon's entropy is a clear lower bound for statistical compression. The situation is not so well understood for dictionary-based compression. A plausible lower bound is $b$, the least number of phrases of a general bidirectional parse of a text, where phrases can be copied from anywhere else in the text.
Gonzalo Navarro 0001   +2 more
openaire   +5 more sources

On the Approximability of Digraph Ordering [PDF]

open access: yesAlgorithmica, 2015
Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling $\ell : V \to [k]$ maximizing the number of forward edges, i.e. edges (u,v) such that $\ell$(u) < $\ell$(v). For different values of k, this reduces to Maximum Acyclic Subgraph (k=n), and Max-Dicut (k=2).
Sreyash Kenkre   +3 more
openaire   +4 more sources

Consistent Approximation of Fractional Order Operators [PDF]

open access: yesJournal of Dynamic Systems, Measurement, and Control, 2021
Abstract Fractional order controllers become increasingly popular due to their versatility and superiority in various performances. However, the bottleneck in deploying these tools in practice is related to their analog or numerical implementation.
Yiheng Wei   +3 more
openaire   +3 more sources

Body-Ordered Approximations of Atomic Properties [PDF]

open access: yesArchive for Rational Mechanics and Analysis, 2022
AbstractWe show that the local density of states (LDOS) of a wide class of tight-binding models has a weak body-order expansion. Specifically, we prove that the resulting body-order expansion for analytic observables such as the electron density or the energy has an exponential rate of convergence both at finite Fermi-temperature as well as for ...
Jack Thomas   +2 more
openaire   +2 more sources

A note on the polynomial approximation of vertex singularities in the boundary element method in three dimensions [PDF]

open access: yes, 2008
We study polynomial approximations of vertex singularities of the type $r^\lambda |\log r|^\beta$ on three-dimensional surfaces. The analysis focuses on the case when $\lambda > -\frac 12$.
Bespalov, A, Bespalov, Alexei
core   +5 more sources

Approximate Partial Order Reduction [PDF]

open access: yes, 2018
We present a new partial order reduction method for reachability analysis of nondeterministic labeled transition systems over metric spaces. Nondeterminism arises from both the choice of the initial state and the choice of actions, and the number of executions to be explored grows exponentially with their length.
Chuchu Fan   +2 more
openaire   +3 more sources

Second order approximations for limit order books [PDF]

open access: yesFinance and Stochastics, 2018
In this paper we derive a second order approximation for an infinite dimensional limit order book model, in which the dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator (e.g.~the volume standing at the top of the book).
Ulrich Horst, Dörte Kreher
openaire   +4 more sources

On the order of approximation in approximative triadic decompositions of tensors

open access: yesTheoretical Computer Science, 1989
Based on \textit{A. Alder's} result [Grenzrang und Grenzkomplexität aus algebraischer und topologischer Sicht, Dissertation, Univ. Zürich (1984)] on the equivalence of algebraic and topological border rank of tensors t over algebraically closed ground fields k, the author gives an upper bound for the order of approximation in approximative triadic ...
Thomas Lehmkuhl, Thomas Lickteig
openaire   +1 more source

Home - About - Disclaimer - Privacy