Search results for "PROB"
showing 10 items of 8859 documents
Parallel fictitious domain method for a non‐linear elliptic neumann boundary value problem
1999
Parallelization of the algebraic fictitious domain method is considered for solving Neumann boundary value problems with variable coefficients. The resulting method is applied to the parallel solution of the subsonic full potential flow problem which is linearized by the Newton method. Good scalability of the method is demonstrated on a Cray T3E distributed memory parallel computer using MPI in communication. Copyright © 1999 John Wiley & Sons, Ltd.
A posteriori estimates for the stationary Stokes problem in exterior domains
2020
This paper is concerned with the analysis of the inf-sup condition arising in the stationary Stokes problem in exterior domains and applications to the derivation of computable bounds for the distance between the exact solution of the exterior Stokes problem and a certain approximation (which may be of a rather general form). In the first part, guaranteed bounds are deduced for the constant in the stability lemma associated with the exterior domain. These bounds depend only on known constants and the stability constant related to bounded domains that arise after suitable truncations of the unbounded domains. The lemma in question implies computable estimates of the distance to the set of di…
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
1996
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…
Stubborn sets, frozen actions, and fair testing
2021
Many partial order methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method tha…
Nonstochastic languages as projections of 2-tape quasideterministic languages
1998
A language L (n) of n-tuples of words which is recognized by a n-tape rational finite-probabilistic automaton with probability 1-e, for arbitrary e > 0, is called quasideterministic. It is proved in [Fr 81], that each rational stochastic language is a projection of a quasideterministic language L (n) of n-tuples of words. Had projections of quasideterministic languages on one tape always been rational stochastic languages, we would have a good characterization of the class of the rational stochastic languages. However we prove the opposite in this paper. A two-tape quasideterministic language exists, the projection of which on the first tape is a nonstochastic language.
Algebraic and logical characterizations of deterministic linear time classes
1997
In this paper an algebraic characterization of the class DLIN of functions that can be computed in linear time by a deterministic RAM using only numbers of linear size is given. This class was introduced by Grandjean, who showed that it is robust and contains most computational problems that are usually considered to be solvable in deterministic linear time.
Multi-letter reversible and quantum finite automata
2007
The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…
Some problems in number theory that arise from group theory
2021
In this expository paper, we present several open problems in number theory that have arisen while doing research in group theory. These problems are on arithmetical functions or partitions. Solving some of these problems would allow to solve some open problem in group theory.
A note on quarkonial systems and multilevel partition of unity methods
2013
We discuss the connection between the theory of quarkonial decompositions for function spaces developed by Hans Triebel, and the multilevel partition of unity method. The central result is an alternative approach to the stability of quarkonial decompositions in Besov spaces , s > n(1/p − 1)+, which leads to relaxed decay assumptions on the elements of a quarkonial system as the monomial degree grows.