An infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a computable function. We prove that a Π01 class P contains a complex element if and only if it contains a wtt-cover for the Cantor set. That is, if and only if for every real Y there is an X in the P such that X >wtt Y . We show that this is also equivalent to the Π01 class’s being l...

A three-level domain decomposition is considered. Bodies in contact with each other are divided into subdomains, which in turn are the union of elements. Using an approach based purely on FETI (finite element tearing and interconnecting) algorithms with only Lagrange multipliers as unknowns, which has been developed by the engineering community, does not lead to a scalable algorithm with respec...

A weak form Galerkin finite element model for the nonlinear quasi-static and fully transient analysis of initially straight viscoelastic beams is developed using the kinematic assumptions of the third-order Reddy beam theory. The formulation assumes linear viscoelastic material properties and is applicable to problems involving small strains and moderate rotations. The viscoelastic constitutive...

Abstract. In this paper we devise a new multi-dimensional integral transform within the Clifford analysis setting, the so-called Fourier-Bessel transform. It appears that in the two-dimensional case, it coincides with the Clifford-Fourier and cylindrical Fourier transforms introduced earlier. We show that this new integral transform satisfies operational formulae which are similar to those of t...

Interconnected systems are an important class of mathematical models, as they allow for the construction of complex, hierarchical, multiphysics, and multiscale models by the interconnection of simpler subsystems. Lagrange–Dirac mechanical systems provide a broad category of mathematical models that are closed under interconnection, and in this paper, we develop a framework for the interconnecti...

A new flexibility-based component mode synthesis method is presented, which is derived by approximating the partitioned equations of motion that employ a localized method of Lagrange multipliers. The use of the localized Lagrange multipliers leads to, unlike the classical Lagrange multipliers, a linearly independent set of interface forces without any redundancies at multiply connected interfac...

In 1798 J.-L. Lagrange published an extensive book on the solution of numerical equations. Lagrange had developed a general systematic algorithm for detecting, isolating, and approximating all real and complex roots of a polynomial equation with real coeecients, with arbitrary precision. In contrast to Newton's Method, Lagrange's algorithm is guaranteed to converge. We discuss some lesser known...

5.1. The problem 5.2. The test statistics 5.3. The inequality 5.4. A numerical example 5.5. Instrumental variables 6. Asymptotic equivalence and optimality of the test statistics 7. The Lagrange Multiplier test as a diagnostic 8. Lagrange Multiplier tests for non-spherical disturbances 8.1. Testing for heteroscedasticity 8.2. Serial correlation 9. Testing the specification of the mean in severa...

In recent years, parallel computers have changed techniques to solve problems in various kinds of fields. In parallel computers of distributed memory type, data can be shared by communication procedures called message-passing, whose speed is slower than that of computations in a processor. From a practical point of view, it is important to reduce the amount of message-passing. Domain-decomposit...

For a locally compact abelian group $G$, J. L. Taylor (1971) gave complete characterization of invertible elements in the measure algebra $M(G)$. Using Fourier-Stieltjes transform, this can be carried out context algebras $B(G)$. We obtain latter for $B(G)$ certain classes groups, particular, many totally minimal groups and $ax+b$-group.