Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Coverings of topological loops

In this paper, we show that in some cases, no proper covering of a locally compact group topologically generated by left translations of a topological loop can occur as the group topologically generated by left translations of a topological loop. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 22, Algebra and Geometry, 2004.     

A method for calculating invariant subspaces of symmetric hyperbolic equations

An algorithm is constructed for calculating invariant subspaces of symmetric hyperbolic systems arising in electromagnetic, acoustic, and elasticity problems. Discrete approximations are calculated for subspaces that correspond to minimal eigenvalues and smooth eigenfunctions. Difficulties related to the presence of an infinite-dimensional kernel in the differential operator are successfully handled. The efficiency of the algorithm is demonstrated using acoustics equations.     

On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002     

Reductions of interval nonlinear programming problem

A general nonlinear programming problem with interval functions is considered. Two reductions of this problem to the deterministic nonlinear programming problem are proposed, and illustrative examples are discussed.     

Nonlinear Theory of Spectra of Thermally Stimulated Currents in Complex Crystals with Hydrogen Bonds

The nonlinear theory of thermally stimulated depolarization currents is developed. The theory explains the processes of hetero- and homocharge relaxation in complex crystals with hydrogen bonds and allows the relaxation oscillator parameters to be calculated using the quadratic approximation for the external electric field.     

A negatively charged silicon vacancy in SiC: Spin polarization effects

The equilibrium geometry and hyperfine interaction constants of the nearest and next-to-nearest neighbor atoms are calculated for a negatively charged silicon vacancy in the high-spin state in cubic SiC. The calculations are performed within the cluster approach in terms of the density-functional theory (DFT). It is shown that the results of calculations with the use of a 70-atom cluster are in good agreement with experimental data. A detailed consideration is given to spin polarization in the electron subsystem and the applicability of a simple LCAO model that is commonly used in the interpretation of the electron paramagnetic resonance data for semiconductors. The spin density distribution for the defect under investigation is analyzed in terms of localized orbitals.     

ω-meson photoproduction on nucleons in the near-threshold region

The European Physical Journal A - The ω-meson photoproduction, γ + p→p + ω, is studied in the framework of a model, containing π-meson exchange in t-channel and...     

Stochastic radiative transfer in a finite plane-parallel medium with general boundary conditions

The time-independent radiative transfer problem in a scattering and absorbing planar random medium with general boundary conditions and internal energy source is considered. The medium is assumed to consist of two randomly mixed immiscible fluids, with the mixing statistics described as a two-state homogeneous Markov process. The problem is solved in terms of the solution of the corresponding free-source problem with simple boundary conditions which is solved using Pomraning-Eddington approximation in the deterministic case. A formalism, developed to treat radiative transfer in statistical mixtures, is used to obtain the ensemble-averaged solution. The average partial heat fluxes are calculated in terms of the albedoes of the source-free problem. Results are obtained for isotropic and anisotropic scattering for specular and diffused reflecting boundaries.