
	Where results make sense

Topic: Gauss algorithm

Related Topics

LU factorization

Matrix inversion

Cholesky decomposition

Carl Friedrich Gauss

Ottoman Empire

In the News (Sat 19 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Notes on the Orthodox Ecclesiastical Calendar
		Alex also provided the following algorithm that is based on the algorithm derived by the German mathematician Gauss, the principal simplification is that substitutions have been made for the case of Julian calendars and Orthodox Easters.
		This algorithm calculates the number of days AFTER March 21 (Julian) that Easter occurs (Note: It is a much simpler calculation than the Western Easter).
		Carter's algorithm, Butcher's algorithm, and Oudin's algorithm are algorithms for the Western Churches.
	www.smart.net /~mmontes/ortheast.html (1105 words)

	Gauss-Legendre algorithm - Wikipedia, the free encyclopedia
		The Gauss-Legendre algorithm is an algorithm to compute the digits of π.
		The method is based on the individual work of Carl Friedrich Gauss (1777-1855) and Adrien-Marie Legendre (1752-1833) combined with modern algorithms for multiplication and square roots.
		The algorithm has second-order convergent nature, which essentially means that the number of correct digits doubles with each step of the algorithm.
	en.wikipedia.org /wiki/Gauss-Legendre_algorithm (170 words)

	Gauss-Newton algorithm - Wikipedia, the free encyclopedia
		In mathematics, the Gauss-Newton algorithm is used to solve nonlinear least squares problems.
		It is a modification of Newton's method that does not use second derivatives, due to Carl Friedrich Gauss.
		Other algorithms for solving least squares problems include the Levenberg-Marquardt algorithm and gradient descent.
	en.wikipedia.org /wiki/Gauss-Newton_algorithm (199 words)

	bit-player » Blog Archive » The land surveyor’s algorithm
		The sum of all the determinants is twice the area of the polygon.
		I gather that the algorithm is widely used in the computational-geometry community.
		The algorithm seems to be indifferent to many of the anomalies and degeneracies that plague lots of geometric methods.
	bit-player.org /2007/the-land-surveyors-algorithm (1037 words)

	No. 2087 Gauss's Algorithm
		In this version, which he claims to have often heard from Gauss himself, Gauss is seven.
		In fact, we don't know how Gauss did it, only that it was very likely that he counted equal pairs in some way.
		I expect that Gauss really did pull off a dazzling trick two centuries ago; and that he did it by summing pairs.
	www.uh.edu /engines/epi2087.htm (508 words)

	Gauss-Legendre algorithm
		The Gauss-Legendre algorithm is an algorithm to compute the digits of π.
		The method is based on the individual work of Carl Friedrich Gauss (1777 - 1855) and Adrien-Marie Legendre (1752-1833) combined with modern algorithms for multiplication and square roots.
		The algorithm has second order convergent nature, which essentially means that the number of correct digits doubles with each step of the algorithm.
	www.brainyencyclopedia.com /encyclopedia/g/ga/gauss_legendre_algorithm.html (207 words)

	Combinatorial GMDH algorithm (COMBI)
		The output variable is specified in this algorithm in advance by the experimenter.
		The sequence of the basic Combinatorial algorithm computation is described in faq.
		A salient feature of the GMDH algorithms is that, when they are presented continuous or noisy input data, they will yield as optimal some simplified non-physical model.
	www.gmdh.net /GMDH_com.htm (556 words)

	The Gauss Pesach Formula
		The Gauss Pesach formula maps the first day of Pesach for some Hebrew year "A" onto its equivalent Julian date.
		Another limitation of the program's calculations is that the algorithm converts a civilian year into a Hebrew year by adding the constant 3760.
		Shocken points out that Gauss eliminated the Molad Zakein rule considerations by adding 6 hours (.25 days) to the values to be generated by the formula.
	www.geocities.com /Athens/1584/gauss.html (505 words)

	G-Systems
		The algorithm is similar to the Eratosthenes's sieve for separating primes from natural numbers.
		One of the first solutions to the problem we are studying was published by Gauss in his algebraic theory of equation classes [Gauss,1959].
		The enumeration of total number of G-system classes is the same as the enumeration of total number of equation classes, which was studied by Carl Fridrich Gauss nearly 200 years ago.
	www.sweb.cz /vladimir_ladma/english/music/articles/dide99.htm (1781 words)

	Computing Papers on Gauss (Site not responding. Last check: )
		Although it is rich on optimal data structures to reduce the storage requirement and ef cient algorithms for fast execution, a proof of correctness of the algorithm, applied to the general problem of point location relative to any arbitrary surface in 3-space, is absent in the literature.
		This paper argues that the electromagnetic eld theory and Gauss s Law constitute a fundamental basis for the odd parity rule and shows that the odd parity rule may be correctly extended to point location relative to any arbitrary closed surface in 3-space.
		It is said that Gauss was less than ten years old when he noted the regularity in the sequence of positive integers 1 through 100 and computed their sum instantly.
	computing.breinestorm.net /Gauss (3031 words)

	The Generalized Gauss Reduction Algorithm - Kaib, Schnorr (ResearchIndex)
		Abstract: We generalize the Gauss algorithm for the reduction of two--dimensional lattices from the l 2 -norm to arbitrary norms and extend Vall'ee's analysis [J. Algorithms 12 (1991), 556-572] to the generalized algorithm.
		1 Introduction Gauss [Ga1801] gave, in the language of qaudratic forms, an algorithm which reduces a basis a; b of a two--dimensional lattice and finds the two successive minima of the lattice.
		3 Flajolet: The Lattice Reduction Algorithm of Gauss: An Avera..
	citeseer.ist.psu.edu /199493.html (508 words)

	Computer Simulation Of Cell-Surface Signalling And Control Of Cellular Division And Differentiation
		It has been demonstrated that the expected benefit from parallelisation of the algorithm will not be gained if the right parameters for SOR method were not chosen before the computation was carried over a parallel platform.
		The multi-colour approach is widely used in algorithms designed for parallel computing environments, since each colour may be assigned to a different process and the updating of unknowns can be carried out independently in each process.
		Before we proceed with the parallel algorithm, we must stress here that the horizontal zebra SOR algorithm is only one of the efficient techniques to solve this problem.
	journal-ci.csse.monash.edu.au /ci/vol03/altas2/altas2.html (2339 words)

	[No title]
		That are the scalar variables in various Krylov algorithms (ff and fi) which conflict with scalar coe?cients in the (Bi-)Lanczos algorithm.
		Unfortunately, the Arnoldi algorithm is expensive in memory and computing time since we need access to all m previous basis vectors and have to perform O(nnz + nm) operations in the mth iteration.
		Further on we refer to this algorithm by the notation z = round to staggered(accu) where z is a staggered number and accu is a long accumulator.
	www.ubka.uni-karlsruhe.de /vvv/2000/mathematik/3/3.text (8360 words)

	Monodromy and Gauß-Manin connection
		The most expensive parts are certain normal form computations for a local ordering and the linear algebra part because here one has to deal iteratively with matrices with several thousand rows and columns.
		In the remaining part of this section we describe a new algorithm, developed by M.
		In the Brieskorn algorithm, we have to start again almost from the beginning.
	www.mathematik.uni-kl.de /~zca/Reports_on_ca/30/paper_html/node2.html (752 words)

	Utilities
		Cameron Rookley's GAUSS to MatLab Perl script, with two supplementary versions: multiple function version, and a program body only version.
		EULER.SRC (Meardon Feb98) defines a procedure pow(base,expo) that tells Gauss to understand it is dealing with a complex number if the base is negative and the exponent is non-integer and then converts the complex number to a real.
		Write Matrix to LaTeX (Isaac May95) writes a GAUSS matrix to a LaTeX input file.
	www.american.edu /academic.depts/cas/econ/gaussres/utilitys/utilitys.htm (586 words)

	QDMSIA 24/93 (Site not responding. Last check: )
		A particular version of this method is numerically compared with the classical Gauss-Newton algorithm and with a modified version of the Gauss-Newton algorithm in which the second order term of the Hessian is approximated by a quasi-Newton technique.
		The results show the superiority of the Gauss-Newton algorithm with quasi-Newton correction versus the algorithms in which the second-order term of the Hessian is neglected and the superiority of the considered version of the new method versus the classical Gauss-Newton algorithm.
		In half of the cases where all three algorithms converge such version of the new method is faster and more accurate.
	wwwesterni.unibg.it /dmsia/reppubl/reports/9324.html (143 words)

	The Gauss-Huard algorithm and LU factorization (ResearchIndex)
		From a description of the algorithm in terms of matrix-vector operations we reveal a close relation between the Gauss-Huard algorithm and an LU factorization as constructed in an ikj variant.
		This method was recognized as an efficient variant of the Gauss-Jordan algorithm and has since become known as the Gauss-Huard algorithm [1].
		5 Rehabilitation of the Gauss-Jordan algorithm (context) - Dekker, Hoffmann - 1989
	citeseer.ist.psu.edu /80890.html (388 words)

	Background for Linear Systems
		The Gauss Algorithm reduces systems of linear algebraic equations to a triangular or standard form.
		A first guess for an analogous method for linear systems of differential equations is to apply the Gauss algorithm to such systems with their derivatives and dependent variables regarded as unknowns.
		In rough terms, for linear systems his algorithm repeats the steps of Gauss reducing the system, calculating and reducing its integrability conditions, adjoining nontrivial integrability conditions to the system, until there are no nontrivial integrability conditions.
	www.orcca.on.ca /~reid/DetResDesMat/DetResDes/node3.html (286 words)

	How many primes are there?
		Gauss was also studying prime tables and came up with a different estimate (perhaps first considered in 1791), communicated in a letter to Encke in 1849 and first published in 1863.
		Notice again that Gauss' conjecture is equivalent to the prime number theorem.
		de la Vallée Poussin also proved that Gauss' Li(x) is a better approximation to pi(x) than x/(log x -a) no matter what value is assigned to the constant a (and also that the best value for a is 1).
	primes.utm.edu /howmany.shtml (1731 words)

	Mathematics of Computation
		The algorithm uses only rational operations and is therefore also useful for obtaining the Jacobi-Kronrod matrix analytically.
		Derivation and implementation of an algorithm for singular integrals.
		Algorithm 726: ORTHPOL - a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules.
	www.ams.org /mcom/1997-66-219/S0025-5718-97-00861-2/home.html (250 words)

	Gauss Jordan 5x5 Solver
		On completion of the algorithm, the augmented matrix would be transformed to:
		If the algorithm determines that the system is singular, having no solution, a pop-up message will be displayed.
		The Gauss-Jordan algorithm performs operations to arrange the system matrix to meet the above criteria.
	home.att.net /~srschmitt/script_gauss_jordan55.html (462 words)

	SSRN-A Nonlinear Gauss-Seidel Algorithm for Inference About GLMM by Jiming Jiang
		A nonlinear Gauss-Seidel type algorithm is proposed for computing the maximum posterior estimates of the random effects in a generalized linear mixed model.
		We show that the algorithm converges in virtually all typical situations of generalized linear mixed models.
		A numerical example shows the superiority of the proposed algorithm over the standard Newton-Raphson procedure when the number of random effects is large.
	papers.ssrn.com /sol3/papers.cfm?abstract_id=235427 (173 words)

	Ecclesiastical Calendar: Enter a Year...
		The algorithm used to calculate the date of Easter in the Western tradition (after 1582) is from Practical Astronomy with your Calculator by Peter Duffett-Smith and he got it from "Butcher's Ecclesiastical Calendar" (1876); apparently the algorithm was first published anonomously in
		The algorithm is valid for all years in the Gregorian calendar, that is October 1582 and onwards.
		Carter's algorithm is a more simple method for calculating the date of Easter and it is valid only from 1900 until 2099.
	www.smart.net /~mmontes/ec-cal.html (2614 words)

	Gauß Algorithm - AutoIt Forums
		i have written an autoitscript, which performs the gauß algorithm on a n x n matrix.
		i was supposed to write it with excel, but in order to get the algorithm in my head, i first wrote it with autoit:
		A * Searching Algorithm - Artificial Intelligence bot path finding
	www.autoitscript.com /forum/index.php?showtopic=48294 (168 words)

	Standard Deviation: Formula, Algorithm, Software
		Generate combinations inside the bell (Gauss) curve, around the median.
		That is, the square root of: the number of trials (events) N, multiplied by the probability p, multiplied by the opposite probability (or 1 minus p).
		Also learn how to calculate, analyze, equation, algorithm, deviation, standard, average, mean, program, data, rule.
	www.saliu.com /deviation.html (2803 words)

	Publications
		Exler, K. Schittkowksi (2006): A trust region SQP algorithm for mixed-integer nonlinear programming, Optimization Letters, Vol.
		M. Liepelt, K. Schittkowski (2000): Algorithm 746: New features of PCOMP, a FORTRAN code for automatic differentiation, ACM Transactions on Mathematical Software, Vol.
		K. Schittkowski (2000): Parameter estimation in a mathematical model fur substrate diffusion in a metabolically active cutaneous tissue, Progress in Optimization, X. Yang et al.
	www.uni-bayreuth.de /departments/math/~kschittkowski/refercs.htm (2431 words)

	Gauss-Kuzmin-Wirsing Constant -- from Wolfram MathWorld
		This constant is connected to the efficiency of the Euclidean algorithm.
		SEE ALSO: Continued Fraction, Euclidean Algorithm, Gauss-Kuzmin Distribution, Khinchin's Constant, Khinchin-Lévy Constant.
		Daudé, H.; Flajolet, P.; and Vallé, B. "An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction." Combin.
	mathworld.wolfram.com /Gauss-Kuzmin-WirsingConstant.html (276 words)

	Sample C#-Code: simple Gauss filter
		The algorithm makes its own quadratic filter kernel with circularily symmetric values of a Gaussian bell-shaped curve.
		The bell-shaped curve automatically adjusts (at any kernel size) its central value to 1.0 and its corner values to 0.01.
		The algorithm works with any image format that can be read and written with the
	www.tfh-berlin.de /~miszalok/Samples/IP/gauss_filter/simple_gauss_filter.htm (244 words)

	Main Frame in Main Page
		Gaussx has full support for all Gauss PQG routines, while for GAUSSPlot, interactive customization of a graph can be saved and used in subsequent sessions.
		All Gauss commands, logical goto, DO loops, and Gauss procs can be used within a Gaussx file.
		Gauss statements can be included within the command file.
	www.econotron.com /gaussx/frmain.htm (1638 words)

	[No title] (Site not responding. Last check: )
		The EM algorithm assumes that the underlying data follows a Gauss mixture distribution and tries to fit a GMM to the data, while Gauss mixture vector quantization is a Lloyd clustering algorithm and it does not make any assumptions about the statistics of the underlying data.
		We design a tree-structured Gauss mixture vector quantizer (TS-GMVQ) by first growing the tree into the "difficult" regions, and then optimally pruning it based on the BFOS algorithm to avoid overfitting.
		Previous work on the EM algorithm and Gauss mixture vector quantization has emphasized single sensor classification problems.
	www-isl.stanford.edu /abstracts/fooozonat.html (293 words)

	The Gauss-Seidel Algorithm
		Again, the Gauss-Seidel Algorithm can be applied to the system (2.19) directly, and at each relaxation iteration an implicit nonlinear equation must be solved :
		Whit87] states that this nonlinear implicit equation can be iterated with the Newton-Raphson algorithm, and has the great advantage, that the Newton-Raphson iteration does not have to be iterated to convergence at each step of the Gauss-Seidel relaxation.
		It suffices to compute only one Newton-Raphson iteration, and the resulting algorithm is called Gauss-Seidel-Newton.
	www.exp-math.uni-essen.de /~ajung/diplom/node18.html (206 words)

Try your search on: Qwika (all wikis)