نتایج جستجو برای: quasi simple

تعداد نتایج: 535873  

Journal: :Numerische Mathematik 2016
Hendrik Speleers Carla Manni

We present a general and simple procedure to construct quasi-interpolants in hierarchical spaces, which are composed of a hierarchy of nested spaces. The hierarchical quasi-interpolants are described in terms of the truncated hierarchical basis. Once for each level in the hierarchy a quasi-interpolant is selected in the corresponding space, the hierarchical quasi-interpolants are obtained witho...

1998
Yao-Zhong Zhang Mark D. Gould

We introduce the quasi-Hopf superalgebras which are Z2 graded versions of Drinfeld’s quasi-Hopf algebras. We describe the realization of elliptic quantum supergroups as quasi-triangular quasi-Hopf superalgebras obtained from twisting the normal quantum supergroups by twistors which satisfy the graded shifted cocycle condition, thus generalizing the quasi-Hopf twisting procedure to the supersymm...

1998
Sergei Chumakov

A method for the generation of quasi-isometric boundarytted curvilinear coordinate systems for arbitrary domains is developed on the basis of the theory of conformal, quasi-conformal and quasi-isometric mappings and results from the non-Euclidean geometry concerning surfaces of constant curvature. The method as it is proposed has an advantage of similar methods developed earlier that number of ...

G.H. Farrahi M. R. Movahhedy Y. Tadi benii

This paper presents a complete derivation and implementation of the Arbitrary Lagrangian Eulerian (ALE) formulation for the simulation of nonlinear static and dynamic problems in solid mechanics. While most of the previous work done on ALE for dynamic applications was mainly based on operator split and explicit calculations, this work derives the quasi-static and dynamic ALE equations in its si...

1997
Madhukar R. Korupolu Vijaya Ramachandran

In this paper we introduce a new class of dynamic graph algorithms called quasi-fully dynamic algorithms, which are much more general than the backtracking algorithms and are much simpler than the fully dynamic algorithms. These algorithms are especially suitable for applications in which a certain core connected portion of the graph remains xed, and fully dynamic updates occur on the remaining...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید