Abstract:
The method and the computer-related products provide for error information relating to inconsistencies in a system of differential equations that describes a technical system or a technical process.

Description:
CROSS-REFERENCE TO RELATED APPLICATION  
       [0001]    This application is a continuation of copending International Application No. PCT/DE02/01878, filed May 23, 2002, which designated the United States and which was not published in English. 
     
    
     
       BACKGROUND OF THE INVENTION  
       FIELD OF THE INVENTION  
         [0002]    The invention relates to a method for providing error information relating to inconsistencies in a system of differential equations.  
           [0003]    It is known in the prior art to describe a technical system with systems of differential equations. With the assistance of numerical methods using a computer system, or of an analog computer, it is possible to simulate the systems by calculating solutions to the systems of differential equations for specific initial or boundary conditions. Examples for the description of technical systems and typical simulation methods can be taken from standard works of the relevant field of specialization. Detailed instructions therefor are specified, for example, in G. Schmidt, “Grundlagen der Regelungstechnik” [“Principles of Control Engineering”], 2nd edition, Springer, Berlin, 1987, in Unbehauen, “Regelungstechnik I” [“Control Engineering I”], 6th edition, Friedr. Viehweg &amp; Sohn, Braunschweig/Wiesbaden, 1989, in Unbehauen, “Regelungstechnik II” [“Control Engineering II”], 5th edition, Friedr. Viehweg &amp; Sohn, Braunschweig/Wiesbaden, 1989, in Unbehauen, “Regelungstechnik III” [“Control Engineering III”], 2nd edition, Friedr. Viehweg &amp; Sohn, Braunschweig/Wiesbaden, 1986, in E. Pfeiffer, “Einführung in die Dynamik” [“Introduction to Dynamics”], B. G. Teubner, Stuttgart, 1989, and in E. Ziegler (ed.), “Teubner-Taschenbuch der Mathematik” [“Teubner Manual of Mathematics”] B. G. Teubner, Stuttgart, 1996. When simulating, the problem frequently arises that a method for numerically solving a system of differential equations will terminate because the fundamental system of differential equations is singular. For the same reason, it can happen that an analog computer cannot foresee the system behavior. In addition, it frequently happens that solutions that are not plausible occur when solving the systems of differential equations.  
           [0004]    In such a case, it is known in the prior art that the programmer or a user of a program for solving differential equations is responsible for locating errors. With extensive experience, it is possible to locate the causes of the singularity and, if appropriate, to reduce errors in the modeling of the technical system. This is generally very time consuming and costly.  
           [0005]    A method for automatic structure analysis of very large systems of differential-algebraic equations is described in S. Chowdry et al: “Automatic structure analysis of large scale differential algebraic systems” IMTC 2001. Proceedings of the 18th IEEE Instrumentation and Measurement Technology Conference, Budapest, Hungary, May 21-23, 2001, IEEE Instrumentation and Measurement Technology Conference (IMTC): New York, N.Y.: IEEE, US, Vol. 1 of 3, Conf. 18, May 21, 2001 (2001-05-21), pages 798-803. This method takes account both of numerical and of symbolic information, and also incorporates the effects of linear terms rigorously into the mathematical system, and is capable of providing a very accurate representation of the structure of a system of differential-algebraic equations.  
           [0006]    A structural algorithm that takes account of the structural properties of systems of differential-algebraic equations is described in the scientific article by J. Unger et al: “Structural analysis of differential-algebraic equation systems-theory and applications” Comput. Chem. Eng.; Computers &amp; Chemical Engineering August 1995, Pergamon Press Inc., Tarrytown, N.Y., USA, Vol. 19, No. 8, August 1995 (1995-08), pages 867-882. In that case, two systematically different structural approaches are implemented on a computer system in order to analyze systems of differential-algebraic equations structurally. These computer programs are applied both as separate programs for supporting the development of simulation models with a low index, and as constituents of the DIVA simulation environment, in order to facilitate a selection of suitable numerical algorithms, and to calculate consistent initial conditions.  
           [0007]    The fact that the structural index of a linear differential-algebraic equation with constant coefficients and with the index  1  can be arbitrarily high and to that extent contradicts a result previously published in the literature is shown by the scientific publication by Gunter Reissig et al: “Differential-algebraic equations of index  1  may have an arbitrarily high structural index” Siam J. SCI. Comput.; Siam Journal of Scientific Computing 2000 SOC for Industrial &amp; Applied Mathematics Publ., Philadelphia, Pa., USA, Vol. 21, No. 6, 2000, pages 1987-1990. This publication further states that when applied to differential-algebraic equations with an index of  1 , Pantelides&#39; algorithm can execute an arbitrarily high number of iterations and differentiations.  
         SUMMARY OF THE INVENTION  
         [0008]    It is accordingly an object of the invention to provide a method for providing error information relating to inconsistencies in a system of differential equations which overcomes the above-mentioned disadvantages of the heretofore-known devices and methods of this general type.  
           [0009]    With the foregoing and other objects in view there is provided, in accordance with the invention, a method for predicting the behavior of a technical system starting from prescribed system properties, boundary conditions, and/or starting from prescribed influences on the system. The method comprises the following steps:  
           [0010]    providing a computer system;  
           [0011]    defining a system of equations describing the technical system, the equations having the form  f (t, x (t),  {dot over (x)} (t), . . . ,  x   (k) (t), p )= 0 , and including:  
                   f   1          (     t   ,       x   _          (   t   )       ,         x   .     _          (   t   )       ,   …              ,         x   _       (   k   )            (   t   )       ,     p   _       )       =   0     ,                     f   2          (     t   ,       x   _          (   t   )       ,         x   .     _          (   t   )       ,   …              ,         x   _       (   k   )            (   t   )       ,     p   _       )       ≂   0     ,             ⋮                   f   n          (     t   ,       x   _          (   t   )       ,         x   .     _          (   t   )       ,   …              ,         x   _       (   k   )            (   t   )       ,     p   _       )       =   0     ,                               
 
           [0012]    wherein  x (t) and derivatives  {dot over (x)} (t), . . . ,  x   (k) thereof in each case have m elements, and  p  is a parameter vector that can occur in the system of equations; and  
           [0013]    executing a test method for providing error information relating to inconsistencies in the system of equations on the computer system, the test method having the following steps 1 to 3:  
           [0014]    step 1: setting up a dependence matrix  A  with m columns and n rows, and setting an element  A  to  A (i,j)≠0 when an i th  row of  f  defined with  f   i (t, x (t),  {dot over (x)} (t), . . . ,  x   (k) (t),) is a function of  
           [0015]    a) a j th  element of  x  expressed as  x   j (t); or  
           [0016]    b) one of the derivatives of the j th  element of  x  defined as  x   j   (s) (t);  
           [0017]    and otherwise setting the element  A (i, j)=0;  
           [0018]    step 2: determining a set of row ranks each having the numbers of those rows of the dependence matrix  A  that are mutually dependent and determining a set of column ranks of the dependence matrix  A  each having the numbers of those columns of the dependence matrix  A  that are mutually dependent if such row ranks and/or column ranks are present; and  
           [0019]    step 3: outputting error information containing the numbers contained in each row rank determined in step 2 and in each column rank determined in step 2.  
           [0020]    The invention is based on the idea of examining the system of differential equations for inconsistencies with the aid of combinatorial methods as early as before a simulation, that is to say before executing numerical calculating steps or building an analog computer. When information relating to such inconsistencies is at hand, it is possible to deduce errors in the modeling of the technical system, or errors in the technical system itself, that can cause undesired contamination in a later simulation step, or even render the system incapable of being simulated. There is no need for a time-consuming execution of the simulation as far as termination, nor for a trial simulation. The correction of the model of the technical system or of the technical system itself is substantially facilitated by the presence of information relating to inconsistencies.  
           [0021]    The first step, of the method according to the invention, provides for setting up a dependence matrix  A . The dependence matrix  A  has exactly as many columns as the dimension of the solution vector  x  of the system of differential equations. The dependence matrix  A  has exactly as many rows as the number of differential equations in the given system of differential equations.  
           [0022]    The invention is not limited in this case only to systems of differential equations of the form  f (t, x (t), {dot over (x)} (t), . . . ,  x   (k) (t), p )= 0 . It can also be applied to special cases in which the system of equations for simulating the technical system has the form, for example, of  f (t, x (t))= 0 . In such a case, the talk is not of a system of differential equations but of a generally nonlinear system of equations.  
           [0023]    Moreover, it is not absolutely necessary for the system of differential equations that is provided for the simulation to be examined itself for inconsistencies. Moreover, another system of differential equations that describes the same technical system or the same technical process can be examined for inconsistencies. This can be advantageous when the last-named system of differential equations has a simpler structure than that to be simulated later. For example, in the simulation of electric networks the equations of modified node voltage analysis are usually the basis of the numerical simulation, although the so-called branch voltage-branch current equations have a substantially simpler structure. It is even possible frequently to determine more inconsistencies or to limit inconsistencies more severely by examining systems of differential equations with a simple structure.  
           [0024]    The dependence matrix  A  in this case has elements  A (i,j) that are set either to the value “zero” or to the value “nonzero”, without regard to the absolute values of the elements of  A . In this case, the element  A (i,j) can be set to a value ≠ 0 when the i th  row of  f  is a function of the j th  element of  x , or of one of the derivatives of the j th  element of  x . In all other cases, the element  A (i,j) is set to the value “0”.  
           [0025]    It is immaterial for the method according to the invention whether the dependence matrix  A  is actually set up explicitly. Rather, what is important is the corresponding information as to whether the i th  row of  f  is a function of the i th  element of  x  or of one of its derivatives, or not, being available in the following method steps.  
           [0026]    In the second step of the method according to the invention, a set of row ranks is determined that in each case have the numbers of those rows of the dependence matrix  A  or those rows of the system of differential equations that are mutually dependent. Moreover, a set of column ranks of the dependence matrix  A  is determined that in each case have the numbers of those columns of the dependence matrix  A  or those components of  x  or one of its derivatives that are mutually dependent.  
           [0027]    Here, “row rank” is understood as follows. A set C z  of natural numbers i, 1≦i≦n, is a row rank of a matrix with n rows and m columns when it fulfils the following conditions:  
           [0028]    (i) there is no transversal T of the matrix  A  such that C z  is contained in the set of row indices of T.  
           [0029]    (ii) for each element c of C z  there is a transversal T of  A  such that C z \{c} is wholly contained in the set of the row indices of T.  
           [0030]    Here, the expression C z \{c} represents that set which results when the element c is removed from the set C z .  
           [0031]    A transversal T of the matrix  A  is understood as follows. A transversal of a matrix  A  with n rows and m columns is one of, if appropriate, a plurality of possible sets of positions (i, j) of non-vanishing matrix entries  A  (i, j), of which no two or more are in the same row or column. A set T of pairs (i, j), 1≦i≦n,1≦j≦m, constitutes a transversal of the matrix  A  if T fulfils the following conditions:  
           [0032]    (i)  A  (i, j) does not vanish for all elements (i, j) of T, and  
           [0033]    (ii) given that (i, j) and (i′, j′) are two different elements of T, that is to say i≠i′ or j≠j′, it holds that i≠i′ and at the same time j≠j′.  
           [0034]    It is of less importance for the invention in this case whether one of the possible transversals of the dependence matrix  A  is calculated. The definition of the term “transversal” is required here, in order to illustrate the terms “row rank” and “column rank”.  
           [0035]    The term “row index of the transversal T” is understood as follows. The set Z of the “row indices of the transversal T” has as elements the row indices of the elements of T. In other words, this means that the set Z contains precisely those numbers i for which there is a j such that the element (i, j) is an element of T.  
           [0036]    A column rank is understood as a set C s  of natural numbers i, 1≦i≦m, of a matrix  A  with n rows and m columns when it fulfils the following conditions:  
           [0037]    (i) there is no transversal T of the matrix  A  such that C s  is contained in the set of column indices of T.  
           [0038]    (ii) for each element c of C s  there is a transversal T of the matrix  A  such that C s \{c} is wholly contained in the set of the column indices of T.  
           [0039]    The “set of column indices of the transversal T” is understood as a set Z that contains as elements the column indices of the elements of the transversal T of the matrix  A . In other words, this means that the set Z contains precisely those numbers j for which there is an i such that the element (i, j) is an element of the transversal T of the matrix  A .  
           [0040]    After step 2 according to the invention is carried out, there is present a set of row ranks that respectively have the numbers of those rows of the dependence matrix  A  or those rows of the system of differential equations that are mutually dependent. Moreover, a set of column ranks of the dependence matrix  A  is present that in each case have the numbers of those columns of the dependence matrix  A  or of those components of  x  or one of its derivatives that are mutually dependent.  
           [0041]    It is particularly easy having this information to deduce structural errors of the system of differential equations that is present as starting point. Such structural errors or inconsistencies in the original system of differential equations are frequently causes of errors in the calculation of the solution of the system of differential equations.  
           [0042]    A basic step in executing the method according to the invention consists in finding row ranks and column ranks. Methods for finding row ranks and column ranks are known. Methods for determining “row ranks” are to be found in the literature under the keyword of “minimally structurally singular subsets of equations” (compare C. C. Pantelides, The consistent initialization of differential-algebraic systems in SIAM J. Sci. Statist. Comput., 9(2):213-231, March 1988). In order to determine “column ranks”, it is possible to use a method for determining “row ranks” when a transposed matrix is determined from that matrix of which the “column ranks” are to be determined. The row ranks of the corresponding transposed matrix are then determined in order to determine the column ranks of the matrix.  
           [0043]    This manner of determining the row ranks and column ranks for the method according to the invention is not to be understood in a limiting way. Rather, it is also possible to use other methods to determine row ranks and column ranks if the remaining conditions for the presence of row ranks and column ranks are fulfilled.  
           [0044]    In the concluding step of the method according to the invention, for each row rank and for each column rank that had been determined in accordance with step 2, the numbers that are contained therein are output. In the case of the row ranks, these numbers indicate the running numbers of the equations of the system of differential equations that are possibly affected by a structural problem. In the case of column ranks, the numbers contained therein and output as error information indicate the numbers of the components of the solution vector  x  that are possibly affected by a structural problem.  
           [0045]    The method according to the invention can be used even before the execution of numerical calculating steps or the building of an analog computer to check the structure of the system of differential equations that is to be calculated for its consistency. If the method according to the invention had detected a system of differential equations as being inconsistent, it is possible to locate a large number of the possible structural errors of the system of differential equations. This accelerates the location of errors. In addition, time-consuming simulation tests are avoided.  
           [0046]    The method according to the invention can be applied for any type of a simulation system for the numerical solution of systems of differential equations, and for the solution of systems of differential equations by means of an analog computer.  
           [0047]    In a particularly advantageous development of the invention, before executing step 1 of the method according to the invention an equation significance list of length n is applied in which each equation of the system of equations is assigned an equation number and/or an item of equation text information. In exactly the same fashion, before executing step 1 of the method according to the invention, a component significance list of length m is applied in which each component of the solution vector  x  is assigned a component number and/or an item of component text information. In this case, the equation text information or component text information respectively stored in the significance list is advantageously selected such that this information acquires a significance in connection to the technical system to be simulated. Consequently, constituents of the simulated technical system and substructures of the technical system to be simulated can be assigned equations of the system of differential equations and components of the solution vector  x  that facilitate an interpretation of the error information output with the aid of the method according to the invention.  
           [0048]    In step 3 of the method according to the invention, for this purpose it is provided to output the equation number and/or the item of equation text information in accordance with the equation significance list instead of outputting the numbers contained in each row rank. For the case in which a whole number i is contained in the row rank, it is not the number i that is output but rather the contents of the i th  component of the equation significance list. In exactly the same fashion, in step 3 of the method according to the invention the component number and/or the item of component text information in accordance with the component significance list is/are output instead of outputting the numbers contained in each column rank. For the case in which the whole number j is present in the column rank as a number, it is not the number j that is output, but rather the contents of the j th  component of the component significance list.  
           [0049]    Owing to this refinement of the method according to the invention, significance contents that refer directly to the technical system to be simulated are output as error information. This error information can be used to illustrate with particular ease, systematic errors in the structure of the system of differential equations for describing the technical system, such that locating the errors is further accelerated.  
           [0050]    In the method according to the invention a preferably digital computer is used that has at least a memory, an arithmetic unit, an input device, and an output device.  
           [0051]    The invention is also implemented in a computer program for providing error information relating to inconsistencies in a system of equations. The computer program is designed in this case such that after inputting of the system properties, the initial or boundary conditions and the influences on the system, it is possible to execute an inventive method in accordance with one of the preceding claims. It is possible in this case to output results of a simulation, the solution vector or the solution vectors at different points in time. However, it is also possible for the computer program to provide only information relating to inconsistencies in accordance with one of the preceding claims.  
           [0052]    Because numerous defective program runs and/or simulation trials can be avoided, the computer program according to the invention results in substantial improvements in run time by comparison with the known simulation programs and simulation methods.  
           [0053]    Moreover, the invention relates to a data carrier with such a computer program, and to a method in which such a computer program is downloaded from an electronic data network, such as from the Internet onto a computer connected to the data network.  
           [0054]    The computer system according to the invention is designed such that it is possible to execute on it a method according to the invention for providing error information relating to inconsistencies in a system of equations.  
           [0055]    Finally, the invention also relates to the use of a method according to the invention and/or a computer system for providing error information relating to inconsistencies in a system of equations.  
           [0056]    In the method according to the invention, the first step is to set up the system or system of differential equations that describes the process, or other forms such as, for example, nonlinear systems of equations that have no differential equations. It is assumed here, in this case, that the person skilled in the art is conversant with the mode of procedure required for this purpose. This is examined in detail in the specialist literature mentioned in the introduction to the description. There are also relevant computer programs for this purpose.  
           [0057]    Other features which are considered as characteristic for the invention are set forth in the appended claims.  
           [0058]    Although the invention is illustrated and described herein, in general, as embodied in a method for providing error information relating to inconsistencies in a system of differential equations, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the spirit of the invention and within the scope and range of equivalents of the claims.  
           [0059]    The construction and method of operation of the invention, however, together with additional objects and advantages thereof will be best understood from the following description of specific embodiments when read in connection with the accompanying drawings. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0060]    [0060]FIG. 1 is a set of functions and a parameter vector illustrating a first exemplary embodiment of the invention;  
         [0061]    [0061]FIG. 2 is a matrix and a corresponding set of transversal elements;  
         [0062]    [0062]FIG. 3 is a set of functions and a parameter vector describing a second exemplary system;  
         [0063]    [0063]FIG. 4 is a matrix, a transversal, and column and row results;  
         [0064]    [0064]FIG. 5 is an exemplary display of error results;  
         [0065]    [0065]FIG. 6 is a schematic of an equivalent circuit;  
         [0066]    [0066]FIG. 7 shows an equation significance list G and a component significance list K; and  
         [0067]    [0067]FIG. 8 is a resultant error list. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0068]    The first exemplary embodiment in accordance with the invention, relates to the simulation of a technical system that can be described by the numerical solution of the system of equations  
             f   ( t,  x   ( t ),   {dot over (x)}   ( t ), . . . ,  x   (k) ( t ),   p   )= 0   
         [0069]    of the form  
           f   1 ( x   1 ( t ), x   2  ( t ), x   3  ( t ), {dot over (x)}   1 ,( t ), {dot over (x)}   2 ( t ), {dot over (x)}   3 ( t ), p   1   ,p   2   ,p   3 )=0,  
           f   2 ( x   1 ( t ), x   2  ( t ), x   3  ( t ), {dot over (x)}   1 ,( t ), {dot over (x)}   2 ( t ), {dot over (x)}   3 ( t ), p   1   ,p   2   ,p   3 )=0,  
           f   3 ( x   1 ( t ), x   2  ( t ), x   3  ( t ), {dot over (x)}   1 ,( t ), {dot over (x)}   2 ( t ), {dot over (x)}   3 ( t ), p   1   ,p   2   ,p   3 )=0,  
         [0070]    having the functions f 1 , f 2  and f 3 , and having the parameter vector  p  in accordance with FIG. 1.  
         [0071]    In order to predict the behavior of the system, the system of equations is solved numerically, that is to say values for the unknown vector  x (t) are calculated at one or more points in time t. For this purpose, known methods of numerical solution are used which run as a computer program on a computer system.  
         [0072]    According to the invention, steps for providing error information relating to inconsistencies in the system of equations are executed before the actual solution of the system of equations.  
         [0073]    The dependence matrix  A  specified in FIG. 2 is determined in step 1 of the method according to the invention, all non-vanishing elements of the dependence matrix  A  being denoted in FIG. 2 by a star (“*”)  
         [0074]    The element  A (1,1) picked out by way of example is set to an essentially arbitrary non-vanishing value “*”, because the first element of  f , that is to say  f 1   (t, x (t), {dot over (x)} (t), . . . ,  x   (k) (t)), is a function of the first element of  x , that is to say of  x   1 (t). The element  A (1,3) picked out by way of example is set to the value “0”, because the third element of  f , that is to say  f 3   (t, x (t), {dot over (x)} (t), . . . ,  x   (k) (t)), is independent of the first element of x, that is to say of  x   1 (t) and of the derivatives of the first element of  x , that is to say  x   1   (S) (t).  
         [0075]    In step 2 of the method according to the invention, the first step is to determine the transversals T, specified in FIG. 2, of the dependence matrix  A  with the aim of determining row ranks and column ranks of the dependence matrix  A  specified in FIG. 2. Methods for determining transversals (of “maximum cardinality bipartite matchings”) are specified in I. S. Duff, “On algorithms for obtaining a maximum transversal”, ACM Trans. Math. Software, 7(3):315-330, 1981, in E. L. Lawler, “Combinatorial Optimization: Networks and Matroids”, Holt, Rinehart and Winston, 1976, in L. Lovasz and M. D. Plummer, “Matching Theory”, North-Holland Mathematics Studies 121. Annals of Discrete Mathematics, 29. North-Holland, 1986, or in C. C. Pantelides, “The consistent initialization of differential algebraic systems”, SIAM J. Sci. Statist. Comput., 9(2):213-231, March 1988.  
         [0076]    The transversal T from FIG. 2 has 3 elements. Since n=m=3, the dependence matrix  A  from FIG. 2 has neither row ranks nor column ranks. No such row ranks of the dependence matrix  A  are found by the method, specified in C. C. Pantelides “The consistent initialization of differential algebraic systems”, for calculating row ranks (“minimally structurally singular subsets of equations”). The method specified there for calculating row ranks also finds no such row rank of the transpose of the dependence matrix  A . It follows that there is no column rank of the dependence matrix  A . The set, determined in step 2 of row ranks of the dependence matrix  A  is empty. The set, determined in step 2 of column ranks of the dependence matrix  A  is likewise empty. Consequently, no error information is output in step 3 of the method according to the invention.  
         [0077]    The system of equations specified at the beginning can be solved with a higher probability without the occurrence of errors. If the simulation is terminated nevertheless, or if it supplies implausible solutions, or if it is entirely impossible, then it is possible to exclude structural errors in the description of the technical system or in the technical system itself with a high degree of probability. This substantially simplifies the location of errors.  
         [0078]    The second exemplary embodiment in accordance with the invention relates to the simulation of a further technical system (not shown here), whose behavior can be described by the numerical solution of the system of equations  
             f   ( t, x   ( t ),   {dot over (x)}   ( t ), . . . ,    x     (k) ( t ),   p   )=0,  
         [0079]    of the form  
           f   1 ( x   1 ( t ), x   2 ( t ), x   3 ( t ),  p   1   , p   2   , p   3 )=0  
           f   2 ( x   1 ( t ), x   2 ( t ), x   3 ( t ),  p   1   , p   2   , p   3 )=0  
           f   3 ( x   1 ( t ), x   2 ( t ), x   3 ( t ),  p   1   , p   2   , p   3 )=0  
         [0080]    having the functions f 1 , f 2  and f 3  and having the parameter vector  p  in accordance with FIG. 3.  
         [0081]    It is aimed to solve the system of equations numerically in order to predict the behavior of the system, that is to say values are to be calculated for the unknown vector  x (t) at one or more points in time t. Use is made for this purpose of known methods of numerical solution (not illustrated here) that run as a computer program on a computer system (not shown here).  
         [0082]    According to the invention, methods for providing error information relating to inconsistencies in the system of equations are executed for the actual solution of the system of equations.  
         [0083]    The dependence matrix  A  specified in FIG. 4 is determined in step 1 of the method according to the invention, all non-vanishing elements of the dependence matrix  A  being denoted by a star (“*”) in FIG. 4.  
         [0084]    The element  A (1,1) picked out by way of example is set to an essentially arbitrary non-vanishing value “*”, because the first row of  f , that is to say  f 1   (t, x (t), . . . ,  x   (k) (t)), is a function of the first element of  x , that is to say of  x   1 (t). The same holds for the elements  A (1,2),  A (1,3),  A (2,3) and  A (3,3).  
         [0085]    The element  A (3,1) picked out by way of example is set to the value “0”, the third element of  f , that is to say  f 3   (t, x (t), {dot over (x)} (t), . . . ,  x   (k) (t)),is independent of the first element of  x , that is to say of  x   1 (t) and of derivatives of the first element of  x , that is to say  x   1   (S) (t). The same holds for the elements  A (2,1),  A (3,2) and  A (2,2).  
         [0086]    In step 2 of the method according to the invention, the first step is to determine the transversals T, specified in FIG. 4, of the dependence matrix  A  with the aim of determining row ranks and column ranks of the dependence matrix  A  specified in FIG. 4.  
         [0087]    The row rank {2, 3} of the dependence matrix  A  is found by the method for calculating row ranks (“minimally structured singular subsets of equations”) specified in C. C. Pantelides “The consistent initialization of differential algebraic systems”. The set Z of the row ranks, found in step 2, of the dependence matrix  A  is specified in FIG. 4.  
         [0088]    The row rank {l,  2 } of the transpose of the dependence matrix  A  is found by the method, specified in C.C. Pantelides, “The consistent initialization of differential-algebraic systems”, for calculating row ranks applied to the transpose of the dependence matrix  A . According to the invention, this row rank of the transpose of the dependence matrix  A  is understood as the column rank of the dependence matrix  A . The set S of the column ranks, found in step 2, of the dependence matrix  A  is specified in FIG. 4. The error information specified in FIG. 5 is output in step 3.  
         [0089]    In accordance with the invention, there is not even an attempt to predict the behavior of the basic system using numerical means, because in this case errors will occur if a simulation is at all possible. However, the modeling of the system and the system itself need to be checked once again. This saves valuable computing time on the computer system (not shown here). Error locating is substantially simplified by the knowledge of the error information output in step 3.  
         [0090]    A third exemplary embodiment in accordance with the invention relates to the technical system shown in FIG. 6, whose behavior can be described by the numerical solution of the system of equations  
           f   1 ( x   1 ( t ), x   2 ( t ), x   3 ( t ),  p   1   , p   2   , p   3 )= 0   
         [0091]    of the form  
           f   2 ( x   1 ( t ), x   2 ( t ), x   3 ( t ),  p   1   , p   2   , p   3 )=0  
           f   3 ( x   1 ( t ), x   2 ( t ), x   3 ( t ),  p   1   , p   2   , p   3 )=0  
         [0092]    having the functions f 1 , f 2  and f 3  and having the parameter vector  p  in accordance with FIG. 3.  
         [0093]    It is aimed to solve the system of equations numerically in order to predict the behavior of the system, that is to say values are to be calculated for the unknown vector  x (t) at one or more points in time t. Use is made for this purpose of known methods of numerical solution that run as a computer program on a computer system.  
         [0094]    Error information relating to inconsistencies in the relevant system of equations is provided in this case as follows according to the invention.  
         [0095]    The solutions of the relevant system of equations are quiescent states or “operating points” or “DC solutions” of the electric network specified in FIG. 6 and which comprises the following network elements (“components”):  
         [0096]    a linear resistor with resistance value R between the nodes  1  and  2  of the network,  
         [0097]    a linear capacitor with a capacitance C 1  between the nodes  1  and  0  of the network, and  
         [0098]    a linear capacitor with a capacitance C 2  between the nodes  2  and  0  of the network.  
         [0099]    This results in the components of the parameter vector p, specified in FIG. 3, being according to the values C 1 ,  1 /R, C 2 .  
         [0100]    The components x 1 (t), x 2 (t) and x 3 (t) of  x (t) correspond to the following variables of the network specified in FIG. 6:  
         [0101]    x 1 (t) corresponds to the voltage between the nodes  1  and  0 ,  
         [0102]    x 2 (t) corresponds to the voltage between the nodes  2  and  0 , and  
         [0103]    x 3 (t) corresponds to the voltage between the nodes  1  and  2 .  
         [0104]    The first equation of the system of equations, that is to say, the equation  
           f   1 ( x   1 ( t ),  x   2 ( t ),  x   3 ( t ),  p   1 ,  p   2 ,  p   3 )=0  
         [0105]    is the Kirchhoff voltage equation for the mesh comprising all the three network elements of the network from FIG. 6.  
         [0106]    The second equation of the system of equations, that is to say, the equation  
           f   2 ( x   1 ( t ),  x   2 ( t ),  x   3 ( t ),  p   1 ,  p   2 ,  p   3 )=0  
         [0107]    is the Kirchhoff current equation for the nodes  1  of the circuit in FIG. 6.  
         [0108]    The third equation of the system of equations, that is to say, the equation  
           f   3 ( x   1 ( t ),  x   2 ( t ),  x   3 ( t ),  p   1 ,  p   2 ,  p   3 )=0  
         [0109]    is the Kirchhoff current equation for the nodes  2  of the circuit in FIG. 6.  
         [0110]    The equation significance list G specified in FIG. 7 and the component significance list K specified in FIG. 7 are designed in accordance with the invention.  
         [0111]    The set Z specified in FIG. 4, of the determined row ranks, and the set S, specified in FIG. 4 of the determined column ranks are determined as in the preceding exemplary embodiments.  
         [0112]    The error information specified in FIG. 8 is output in step 3 of the method developed further in accordance with the invention, use being made of the equation significance list G and the component significance list K from FIG. 7.  
         [0113]    It may be seen from the error information specified in FIG. 8 that the Kirchhoff current equations relating to the nodes  1  and  2  of the network from FIG. 6 are linearly dependent on one another, and that the two voltages between nodes  1  and  0  and between nodes  2  and  0  of the network from FIG. 6 for quiescent states of this network cannot be uniquely determined.  
         [0114]    In accordance with the invention, there is not even an attempt to predict the behavior of the basic system using numerical means, because in this case errors will occur if a simulation is at all possible. However, the modeling of the system and the system itself need to be checked once again. This saves valuable computing time on the computer system. Error locating is substantially simplified by the knowledge of the error information output in step 3.  
         [0115]    The term “computer-readable medium” as used herein should be understood in its broadest sense. That is, it includes, at the least, any kind of computer memory such as floppy disks, hard disks, CD-ROMS, flash ROMs, non-volatile and volatile ROM and RAM, and memory cards, as well as carrier signals for distance communication.