Günter Mayer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Günter Mayer has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Olga Kosheleva
University of Texas at El Paso
2 shared publications - Vladik Kreinovich
Department of Computer Science, University of Texas at El Paso, 500 W. University, El Paso, TX 79968, USA
2 shared publications - Götz Alefeld
Universität Karlsruhe
1 shared publication - Martine Ceberio
University of Texas at El Paso
1 shared publication
Latest Publications
- 25 November 2023
- Published by Springer Nature
- p. 246-257
Complex-Valued Interval Computations are NP-Hard Even for Single Use Expressions
- 25 November 2023
- Published by Springer Nature
- p. 246-257
Complex-Valued Interval Computations are NP-Hard Even for Single Use Expressions
- 20 February 2015
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 475, 73-79
Three short descriptions of the symmetric and of the skew-symmetric solution set
- 20 February 2015
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 475, 73-79
Three short descriptions of the symmetric and of the skew-symmetric solution set
- 1 October 2009
- Published by Springer Nature in Japan Journal of Industrial and Applied Mathematics
- Vol. 26 (2-3) , 279-296
Direct methods for linear systems with inexact input data
- 1 October 2009
- Published by Springer Nature in Japan Journal of Industrial and Applied Mathematics
- Vol. 26 (2-3) , 279-296
Direct methods for linear systems with inexact input data
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 543-548
Towards a General Description of Interval Multiplications: Algebraic Analysis and Its Relation to t-Norms
It is well known that interval computations are very important, both by themselves (as a method for processing data known with interval uncertainty) and as a way to process fuzzy data. In general, the problem of computing the range of a given function under interval uncertainty is computationally difficult (NP-hard). As a result, there exist different methods for estimating such a range: some methods require a longer computation time and lead to more accurate results, other methods lead to somewhat less accurate results but are much faster than the more accurate techniques. In particular, different methods exist for interval multiplication, i.e., for computing the range of a product of two numbers known with interval uncertainty. To select a method which is the best in a given situation, it is desired to be able to describe all possible methods. In this paper, we provide a description of all possible operations for interval multiplication; this description is based on the same ideas as a known description of t-norms in fuzzy logic.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 543-548
Towards a General Description of Interval Multiplications: Algebraic Analysis and Its Relation to t-Norms
It is well known that interval computations are very important, both by themselves (as a method for processing data known with interval uncertainty) and as a way to process fuzzy data. In general, the problem of computing the range of a given function under interval uncertainty is computationally difficult (NP-hard). As a result, there exist different methods for estimating such a range: some methods require a longer computation time and lead to more accurate results, other methods lead to somewhat less accurate results but are much faster than the more accurate techniques. In particular, different methods exist for interval multiplication, i.e., for computing the range of a product of two numbers known with interval uncertainty. To select a method which is the best in a given situation, it is desired to be able to describe all possible methods. In this paper, we provide a description of all possible operations for interval multiplication; this description is based on the same ideas as a known description of t-norms in fuzzy logic.
- 1 April 2006
- Published by Springer Nature in Reliable Computing
- Vol. 12 (2) , 79-98
A Contribution to the Feasibility of the Interval Gaussian Algorithm
- 1 April 2006
- Published by Springer Nature in Reliable Computing
- Vol. 12 (2) , 79-98
A Contribution to the Feasibility of the Interval Gaussian Algorithm
- 30 January 2006
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 199 (2) , 220-228
On regular and singular interval systems
- 30 January 2006
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 199 (2) , 220-228
On regular and singular interval systems
- 1 June 2005
- Published by Springer Nature in Reliable Computing
- Vol. 11 (3) , 165-190
Enclosing Solutions of Singular Interval Systems Iteratively
- 1 June 2005
- Published by Springer Nature in Reliable Computing
- Vol. 11 (3) , 165-190
Enclosing Solutions of Singular Interval Systems Iteratively