506,466 research outputs found
Stable finite element pair for Stokes problem and discrete Stokes complex on quadrilateral grids
In this paper, we first construct a nonconforming finite element pair for the
incompressible Stokes problem on quadrilateral grids, and then construct a
discrete Stokes complex associated with that finite element pair. The finite
element spaces involved consist of piecewise polynomials only, and the
divergence-free condition is imposed in a primal formulation. Combined with
some existing results, these constructions can be generated onto grids that
consist of both triangular and quadrilateral cells
Shell Model Monte Carlo Methods
We review quantum Monte Carlo methods for dealing with large shell model
problems. These methods reduce the imaginary-time many-body evolution operator
to a coherent superposition of one-body evolutions in fluctuating one-body
fields; the resultant path integral is evaluated stochastically. We first
discuss the motivation, formalism, and implementation of such Shell Model Monte
Carlo (SMMC) methods. There then follows a sampler of results and insights
obtained from a number of applications. These include the ground state and
thermal properties of {\it pf}-shell nuclei, the thermal and rotational
behavior of rare-earth and -soft nuclei, and the calculation of double
beta-decay matrix elements. Finally, prospects for further progress in such
calculations are discussed
String rewriting for Double Coset Systems
In this paper we show how string rewriting methods can be applied to give a
new method of computing double cosets. Previous methods for double cosets were
enumerative and thus restricted to finite examples. Our rewriting methods do
not suffer this restriction and we present some examples of infinite double
coset systems which can now easily be solved using our approach. Even when both
enumerative and rewriting techniques are present, our rewriting methods will be
competitive because they i) do not require the preliminary calculation of
cosets; and ii) as with single coset problems, there are many examples for
which rewriting is more effective than enumeration.
Automata provide the means for identifying expressions for normal forms in
infinite situations and we show how they may be constructed in this setting.
Further, related results on logged string rewriting for monoid presentations
are exploited to show how witnesses for the computations can be provided and
how information about the subgroups and the relations between them can be
extracted. Finally, we discuss how the double coset problem is a special case
of the problem of computing induced actions of categories which demonstrates
that our rewriting methods are applicable to a much wider class of problems
than just the double coset problem.Comment: accepted for publication by the Journal of Symbolic Computatio
- …