# Computational methods of linear algebra by V. N. Faddeeva

Best discrete mathematics books

Complexity: Knots, Colourings and Countings

In response to lectures on the complex study Institute of Discrete utilized arithmetic in June 1991, those notes hyperlink algorithmic difficulties bobbing up in knot concept, statistical physics and classical combinatorics for researchers in discrete arithmetic, desktop technological know-how and statistical physics.

Mathematical programming and game theory for decision making

This edited e-book offers contemporary advancements and cutting-edge overview in quite a few parts of mathematical programming and online game concept. it's a peer-reviewed examine monograph lower than the ISI Platinum Jubilee sequence on Statistical technology and Interdisciplinary study. This quantity offers a wide ranging view of conception and the functions of the tools of mathematical programming to difficulties in facts, finance, video games and electric networks.

Introduction to HOL: A Theorem-Proving Environment for Higher-Order Logic

HOL is an evidence improvement approach meant for functions to either and software program. it really is largely utilized in methods: for at once proving theorems, and as theorem-proving help for application-specific verification structures. HOL is presently being utilized to a wide selection of difficulties, together with the specification and verification of serious platforms.

Algebra und Diskrete Mathematik

Band 1 Grundbegriffe der Mathematik, Algebraische Strukturen 1, Lineare Algebra und Analytische Geometrie, Numerische Algebra. Band 2 Lineare Optimierung, Graphen und Algorithmen, Algebraische Strukturen und Allgemeine Algebra mit Anwendungen

Additional info for Computational methods of linear algebra

Sample text

It is known that there are no regular graphs with girth g = 5 and excess e = 1. 12 (P. K O V ~ C[SK o v ~ ] ) : Let T be an oddinteger, T 2 3, # l2 + 1 + 3, and T # l2 + 1 - 1. Then there exists no regular graph of T degree T , girth g = 5 , and excess e = 2. A lower bound for the excess has been given by N. Biggs. For a given k let the polynomials F,(z) be defined recursively by Fo(z) = 1, FI(z) = z + 1, and F,(z) = zF,-I(z) - ( k - l ) F , - 2 ( ~ ) for T 2 2. Suppose G is a graph that is regular of degree k, has girth g = 2r 1 and excess e.

G. Bridges and M. S. Shrikhande [BRSHl] use partially balanced incomplete block designs to construct graphs with six or seven distinct eigenvalues. H. D. Patterson and E. R. Williams [PAW111 measure the efficiency of a block design by taking the harmonic mean of the nonzero eigenvalues of I - A N N T where N is the block incidence matrix of the design with parameters (v, b, T , k). H. Beker and W. Haemers [BEHAI] have investigated balanced incomplete block designs with parameters (v, b, T , k, A) that have k - n for as intersection number for some of the blocks (n = T - A is the design order).

ITO [BIITl]): There is no regular graph of degree T with girth g = 6, excess e = 2 if r 5 mod 8 or r 7 mod 8. There have also been extensions of Moore graphs to the directed case. J. Bosak uses both directed and undirected edges in what he calls a partially directed graph. Such a graph is homogeneous if, for any vertex v, the number of directed edges going into v equals the number of the directed edges going out of v . A partially directed graph with r edges incident to each vertex, diameter d, and with every pair of vertices joined by a unique directed path with length less than d is cdled a ( r ,d ) Moore Graph.