Results 1  10
of
16,038
Parallel SSOR Preconditioning for Lattice QCD
, 1999
"... The locallylexicographic symmetric successive overrelaxation algorithm (ll SSOR) is the most effective parallel preconditioner known for iterative solvers used in lattice gauge theory. After reviewing the basic properties of ll SSOR, the focus of this contribution is put on its parallel aspects: ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
along the other dimensions oddeven preconditioning is used. In this way one can tune the preconditioner towards optimal performance by balancing ll SSOR effectivity and administrative overhead. Key words: parallel preconditioning, SSOR algorithm, lattice quantum chromodynamics, linear solvers
A Parallel SSOR Preconditioner for Lattice QCD ∗
, 1996
"... A parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers in lattice QCD applications involving Wilson fermions is presented. In actual Hybrid Monte Carlo simulations and quark propagator calculations it helps to reduce the number of iterations by a factor of 2 compared to c ..."
Abstract
 Add to MetaCart
A parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers in lattice QCD applications involving Wilson fermions is presented. In actual Hybrid Monte Carlo simulations and quark propagator calculations it helps to reduce the number of iterations by a factor of 2 compared
Scalable Parallel SSOR Preconditioning for Lattice Computations in Gauge Theories
"... . We discuss a parallelization scheme for SSOR preconditioning of Krylov subspace solvers as applied in lattice gauge theory computations. Our preconditioner is based on a locally lexicographic ordering of the lattice points leading to a parallelism adapted to the parallel system's size. By exp ..."
Abstract
 Add to MetaCart
. We discuss a parallelization scheme for SSOR preconditioning of Krylov subspace solvers as applied in lattice gauge theory computations. Our preconditioner is based on a locally lexicographic ordering of the lattice points leading to a parallelism adapted to the parallel system's size
1 SSOR Preconditioning of Improved Actions ∗
, 1997
"... We generalize local lexicographic SSOR preconditioning for the SheikholeslamiWohlert improved Wilson fermion action and the truncated perfect free fermion action. In our test implementation we achieve performance gains as known from SSOR preconditioning of the standard Wilson fermion action. 1. ..."
Abstract
 Add to MetaCart
We generalize local lexicographic SSOR preconditioning for the SheikholeslamiWohlert improved Wilson fermion action and the truncated perfect free fermion action. In our test implementation we achieve performance gains as known from SSOR preconditioning of the standard Wilson fermion action. 1.
Systematic design of program analysis frameworks
 In 6th POPL
, 1979
"... Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant ..."
Abstract

Cited by 771 (52 self)
 Add to MetaCart
Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant
Quantum Gravity
, 2004
"... We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string theor ..."
Abstract

Cited by 566 (11 self)
 Add to MetaCart
We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string theory, cosmology, particle physics, astrophysics and condensed matter physics. No details are given, but references are provided to guide the interested reader to the literature. The present state of knowledge is summarized in a list of 35 key results on topics including the hamiltonian and path integral quantizations, coupling to matter, extensions to supergravity and higher dimensional theories, as well as applications to black holes, cosmology and Plank scale phenomenology. We describe the near term prospects for observational tests of quantum theories of gravity and the expectations that loop quantum gravity may provide predictions for their outcomes. Finally, we provide answers to frequently asked questions and a list of key open problems.
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" realtime programsthose whose safety...
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Results 1  10
of
16,038