Computer Algebra for Guaranteed Accuracy. How Does It Help?

 KANNO Masaaki
 Institute of Science and Technology, Academic Assembly, Niigata University

 ANAI Hirokazu
 Fujitsu Laboratories Ltd./Kyushu University
Search this Article
Author(s)

 KANNO Masaaki
 Institute of Science and Technology, Academic Assembly, Niigata University

 ANAI Hirokazu
 Fujitsu Laboratories Ltd./Kyushu University
Journal

 Japan journal of industrial and applied mathematics

Japan journal of industrial and applied mathematics 26(2), 517530, 20091001
References: 47

1
 <no title>

GOLUB G. H.
Matrix Computations, 1996
Cited by (1)

2
 <no title>

HIGHAM N. J.
Accuracy and Stability of Numerical Algorithms, 2002
Cited by (1)

3
 Selfvalidating methods

RUMP S. M.
Linear Algebra and Its Applications 324, 313, 2001
Cited by (1)

4
 <no title>

KRANDICK W. eds
Journal of Symbolic Computation 24(6), 1997
Cited by (1)

5
 <no title>

KULISCH U. W. eds.
A New Approach to Scientific Computation, 1983
Cited by (1)

6
 <no title>

ROHN J. eds.
Linear Algebra and Its Applications 324(13), 2001
Cited by (1)

7
 <no title>

MOORE R. E.
Interval Analysis, 1966
Cited by (1)

8
 <no title>

NEUMAIER A.
Interval Methods for Systems of Equations, 1990
Cited by (1)

9
 Theory of interval algebra and its application to numerical analysis

SUNAGA T.
RAAG Memoirs of the Unifying Study of Basic Problems in Engineering and Physical Sciences by Means of Geometry 2, 2946 (547564), 1958
Cited by (1)

10
 <no title>

ALEFELD G.
Introduction to Interval Computations, 1983
Cited by (1)

11
 NewtonAlgorithmen zur Bestimmung von Nullstellen mit Fehlerschranken

KRAWCZYK R.
Computing 4, 187201, 1969
Cited by (1)

12
 A test for existence of solutions to nonlinear systems

MOORE R. E.
SIAM Journal on Numerical Analysis 14, 611615, 1977
Cited by (1)

13
 <no title>

MUHANNA R. L. eds.
Reliable Computing 13(2), 2007
Cited by (1)

14
 05391 executive summaryNumerical and algebraic algorithms and computerassisted proofs

BUCHBERGER B.
Algebraic and Numerical Algorithms and ComputerAssisted Proofs, 2006
Cited by (1)

15
 <no title>

VON ZUR GATHEN J.
Modern Computer Algebra, 2003
Cited by (1)

16
 Algebraic computation, numerical computation and verified inclusions

RUMP S. M.
Trends in Computer Algebra, 177197, 1988
Cited by (1)

17
 Computerassisted proofs and selfvalidating methods

RUMP S. M.
Accuracy and Reliability in Scientific Computing, 195204, 2005
Cited by (1)

18
 <no title>

AKRITAS A. G.
Elements of Computer Algebra with Applications, 1989
Cited by (1)

19
 An efficient algorithm for infallible polynomial complex root isolation

COLLINS G. E.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '92, 189194, 1992
Cited by (1)

20
 Cylindrical algebraic decomposition using validated numerics

STRZEBONSKI A. W.
Journal of Symbolic Computation 41, 10211038, 2006
Cited by (1)

21
 <no title>

GANTMACHER F. R.
The Theory of Matrices 2, 1960
Cited by (1)

22
 <no title>

OGATA K.
Modern Control Engineering, 2002
Cited by (1)

23
 <no title>

ACKERMANN J.
Robust Control : Systems with Uncertain Physical Parameters, 1993
Cited by (1)

24
 <no title>

BHATTACHARYYA S. P.
Robust Control : The Parametric Approach, 1995
Cited by (1)

25
 SturmHabicht sequences determinants and real roots of univariate polynomials

GONZALEZVEGA L.
Quantifier Elimination and Cylindrical Algebraic Decomposition, 300316, 1998
Cited by (1)

26
 Fixedstructure robust controller synthesis based on symbolicnumeric computation : design algorithms with a CACSD toolbox

ANAI H.
Proceedings of the 2004 IEEE International Conference on Control Applications, Taipei, Taiwan, 15401545, 2004
Cited by (1)

27
 A parameter space approach to fixedorder robust controller synthesis by quantifier elimination

ANAI H.
International Journal of Control 79, 13211330, 2006
Cited by (1)

28
 <no title>

MOORE R. E.
Methods and Applications of Interval Analysis, 1979
Cited by (1)

29
 <no title>

JAULIN L.
Applied Interval Analysis, 2001
Cited by (1)

30
 <no title>

COX D.
Ideals, Varieties, and Algorithms, 2007
Cited by (1)

31
 <no title>

BECKER T.
Grobner Bases : A Computational Approach to Commutative Algebra, 1993
Cited by (1)

32
 <no title>

ZHOU K.
Robust and Optimal Control, 1996
Cited by (1)

33
 Quantifier elimination for real closed fields by cylindrical algebraic decomposition

COLLINS G.
Proceedings Second GI Conference on Automata Theory and Formal Languages, 1975, 134183, 1975
Cited by (1)

34
 Visualizing parametric solution sets

POPOVA E. D.
BIT Numerical Mathematics 48, 95115, 2008
Cited by (1)

35
 Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem

ANAI H.
Journal of Symbolic Computation 44, 703725, 2009
Cited by (1)

36
 A survey of spectral factorization methods

SAYED A. H.
Numerical Linear Algebra with Applications 8, 467496, 2001
Cited by (1)

37
 On the relationship between the sum of roots with positive real parts and polynomial spectral factorization

KANNO M.
Numerical Methods and Applications6th International Conference, NMA 2006, Borovets, Bulgaria, August, 320328, 2007
Cited by (1)

38
 Sum of roots, polynomial spectral factorization, and control performance limitations

KANNO M.
Proceedings of the 46th IEEE Conference on Decision and Control, New Orleans, Louisiana, USA, 2007, 29682973, 2007
Cited by (1)

39
 Symbolic optimization of algebraic functions

KANNO M.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 2008, Linz, Austria, 147154, 2008
Cited by (1)

40
 The Sensitivity of Computational Control Problems

HIGHAM N. J.
IEEE Control Systems Magazine 24(1), 2843, 2004
DOI Cited by (5)

41
 Special issue on validated numerical methods and computer algebra : Foreword of the guest editors

KRANDICK W.
Journal of Symbolic Computation 24(6), 625626, 1997
DOI Cited by (4)

42
 An efficient method for analyzing the topology of plane real algebraic curves

HONG H.
Mathematics and Computers in Simulation 42, 571582, 1996
Cited by (1)

43
 Approximate quantified constraint solving by cylindrical box decomposition

RATSCHAN S.
Reliable Computing 8(1), 2142, 2002
DOI Cited by (2)

44
 Validated numerical computation of the L_∞norm for linear dynamical systems

KANNO M.
Journal of Symbolic Computation 41(6), 697707, 2006
DOI Cited by (7)

45
 A Modular Method to Compute the Rational Univariate Representation of Zerodimensional Ideals

NORO M.
J. Symbolic Computation 28, 243263, 1999
DOI Cited by (5)

46
 Efficient Computation of ZeroDimensional Grobner Bases by Change of Ordering

J. C. Faugere
J. Symb. Comp. 16/4, 329344, 1993
DOI Cited by (12)

47
 Sum of roots characterization for H_2 control performance limitations

HARA S.
SICE Journal of Control, Measurement, and System Integration 1, 5865, 2008
Cited by (1)