Inicio Nosotros Búsquedas
Buscar en nuestra Base de Datos:     
Palabras claves o descriptores: ERROR BOUNDS (Comienzo)
2 registros cumplieron la condición especificada en la base de información bciucla. ()
Registro 1 de 2, Base de información bciucla
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Wilson, F. ; Goodrich, R. Kent ; Spratte, Wendy
Título: Lawson's Triangulation is Nearly Optimal for Controlling Error Bounds
Páginas/Colación: pp. 190-197
Url: Ir a http://locus.siam.org/SINUM/volume-27/art_0727013.htmlhttp://locus.siam.org/SINUM/volume-27/art_0727013.html
Siam Journal on Numerical Analysis Vol. 27, no. 1 February 1990
Información de existenciaInformación de existencia

Palabras Claves: Palabras: CONDITION NUMBER CONDITION NUMBER, Palabras: ERROR BOUNDS ERROR BOUNDS, Palabras: INTERPOLATION INTERPOLATION, Palabras: TRIANGULATION TRIANGULATION

Resumen
RESUMEN

RESUMEN

One way of evaluating a triangulation method is to study how well it controls error bounds and stability in computations. Lawson’s method, which maximizes the smallest angle over all triangulations, controls error bounds for linear interpolates as well as for certain derivative estimates. In particular, no other triangulation improves these bounds by more than a factor of 2. Although Lawson’s triangulation method does not minimize the largest edge over all triangulations, it nearly does; this edge is no longer than 2 / √3 times the longest edge in any other triangulation. Thus, Lawson’s triangulation method controls error bounds in polynomial interpolation schemes.

 

Registro 2 de 2, Base de información bciucla
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Hochbruck, Marlis ; Lubich, Christian
Título: On Magnus Integrators for Time-Dependent Schrödinger Equations
Páginas/Colación: pp. 945 - 963
Url: Ir a http://epubs.siam.org/sam-bin/dbq/article/40387http://epubs.siam.org/sam-bin/dbq/article/40387
Siam Journal on Numerical Analysis Vol. 41, no. 3 May/July 2004
Información de existenciaInformación de existencia

Palabras Claves: Palabras: COMMUTATOR BOUNDS COMMUTATOR BOUNDS, Palabras: ERROR BOUNDS ERROR BOUNDS, Palabras: MAGNUS INTEGRATORS MAGNUS INTEGRATORS, Palabras: TIME-DEPENDENT SCHRÖDINGER EQUATION TIME-DEPENDENT SCHRÖDINGER EQUATION

Resumen
Numerical methods based on the Magnus expansion are an efficient class of integrators for Schrödinger equations with time-dependent Hamiltonian. Though their derivation assumes an unreasonably small time step size, as would be required for a standard explicit integrator, the methods perform well even for much larger step sizes. This favorable behavior is explained, and optimal-order error bounds are derived that require no or only mild restrictions of the step size. In contrast to standard integrators, the error does not depend on higher time derivatives of the solution, which is in general highly oscillatory.

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno

Generados por el servidor 'bibcyt.ucla.edu.ve' (3.139.238.48)
Adaptive Server Anywhere (07.00.0000)
ODBC
Sesión="" Sesión anterior=""
ejecutando Back-end Alejandría BE 7.0.7b0 ** * *
3.139.238.48 (NTM) bajo el ambiente Apache/2.2.4 (Win32) PHP/5.2.2.
usando una conexión ODBC (RowCount) al manejador de bases de datos..
Versión de la base de información bciucla: 7.0.0 (con listas invertidas [2.0])

Cliente: 3.139.238.48
Salida con Javascript


** Back-end Alejandría BE 7.0.7b0 *