122623073
Symmetrische graphen mit auflösbaren stabilisatoren
124466085
On a theorem of Goldschmidt
46019521
The nonexistence of 8-transitive graphs
We prove that the inequalitys≦7 holds for finites-transitive graphs assuming that the list of known 2-transitive permutation groups is complete.
125321998
A characterization of the group Co 3 as a transitive extension of HS
120974879
Presentations for (G,s)-transitive graphs of small valency
Given a group G , a subgroup H and an element a ∈ G , we define Γ( G, H, a ) to be the graph on the set of left-cosets of H in G , where two left-cosets g 1 H and g 2 H are adjacent whenever . We will consider this construction only in the case that The first of these conditions assures that adjacency is a symmetric relation (i.e. that Γ( G, H, a ) is an undirected graph) and the second assures that Γ( G, H, a ) is connected.
119821589
Distance-transitive graphs and generalized polygons
On etablit un theoreme sur un graphe Γ connexe, regulier de valence k≥3, circonference finie g, avec s≥4. Γ est (G,s)-transitif pour G≤aut(Γ) tel que G(x) est fini pour chaque sommet x
6860028
SOLVEBLOK: A Package for Solving Almost Block Diagonal Linear Systems
Abstract : In spline approximation and in the numerical solution of (systems of) ordinary differential equations, one is eventually faced with linear systems of a rather characteristic, almost block diagonal, form which reflects the underlying geometry of the problems. While these systems could be treated as banded systems, it is more efficient, both in the generation of the systems and in their numerical solution, to work explicitly with their block structure. The report describes a package of FORTRAN routines for the solution of an almost block diagonal system by Gauss elimination with scaled row pivoting. Two examples are given. The first involves the solution of an m-th order ordinary differential equation by collocation. The second example offers a package of routines for the solution of a system of first order ODEs by collection at Lobatto points which is then used on a somewhat tricky reentry problem.
119855015
The application of implicit Runge-Kutta and collection methods to boundary-value problems
The solution of a nonlinear system of first order differential equations with nonlinear boundary conditions by implicit Runge-Kutta methods based on interpolatory quadrature formulae is examined. An equivalence between implicit Runge-Kutta and collocation schemes is established. It is shown that the difference equations obtained have a unique solution in a neighbourhood of an isolated solution of the continuous problem, that this solution can be computed by Newton iteration and that it converges to the isolated solution. The order of convergence is equal to the degree of precision of the related quadra- ture formula plus one. The efficient implementation of the methods is discussed and numerical examples are given. 1. Introduction. We investigate the application of certain implicit Runge- Kutta methods (cf. Butcher (2)) to the numerical solution of nonlinear boundary- value problems of the form
121432014
The convergence of shooting methods
Shooting methods for nonlinear boundary value problems are examined. It is shown that the methods converge whenever the problem is well posed in the sense that the solution to be computed is isolated.
119709952
Product Integration for the Generalized Abel Equation
The solution of the generalized Abel integral equation g(t) f {k(t, s)/(t s)a}f (s) ds, 0 < a < 1, where k(t, s) is continuous, by the product integration analogue of the trapezoidal method is examined. It is shown that this method has order two convergence for a E [al, 1) with al 0.2117. This interval contains the important case a = 2. Convergence of order two for a E (0, al) is discussed and illustrated numerically. The possibility of constructing higher order methods is illustrated with an example.
5600693
Algorithm 546: SOLVEBLOK [F4]
Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for dtrect commercial advantage, the ACM copymght notice and the title of the pubhcation and its date appear, and notme is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to repubhsh, requires a fee and/or specific permission.