Seminumeric algorithm

This article was due to content flaws on the quality assurance side of the computer science editorial added. This is done in order to bring the quality of the articles from the subject area of ​​computer science to an acceptable level. Help to eliminate the shortcomings in this article and take part in the discussion !  ( + )

Seminumeric algorithms are a mixture of numerical and analytical or algebraic methods in programming . Seminumeric algorithms are usually more precise than purely numerical methods, but often require greater implementation effort , since prior knowledge of the numerical relationships in relation to specialized applications or requirements is incorporated instead of using general methods.

A widespread area of ​​application of seminumeric implementations are e.g. B. also computer algebra systems , since numerical and algebraic methods can be mixed with them in an elegant way.

A practical example of a seminumeric algorithm is the integration of systems of differential equations of the first order: exponential functions occurring there can be integrated seminumerically in a simple manner, provided that the Jordan transformation can be determined if these two function types are on the right side of the DGL as well as in the Solution occur.

literature

• Donald Knuth : The Art of Computer Programming, Vol. 2: Seminumerical Algorithms , 3rd ed., Addison-Wesley 1998, ISBN 0-201-89684-2