scispace - formally typeset
Search or ask a question
Author

Jaroslav Kautsky

Bio: Jaroslav Kautsky is an academic researcher from Flinders University. The author has contributed to research in topics: Orthogonal polynomials & Matrix (mathematics). The author has an hindex of 19, co-authored 48 publications receiving 2273 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a technique for equidistributing a function subject to constraints on the ratios of adjacent steps in the mesh is presented and a theoretical analysis of the procedure is presented, and numerical algorithms for implementing the method are given.
Abstract: Adaptive methods which “equidistribute” a given positive weight function are now used fairly widely for selecting discrete meshes. The disadvantage of such schemes is that the resulting mesh may not be smoothly varying. In this paper a technique is developed for equidistributing a function subject to constraints on the ratios of adjacent steps in the mesh. Given a weight function $f \geqq 0$ on an interval $[a,b]$ and constants c and K, the method produces a mesh with points $x_0 = a,x_{j + 1} = x_j + h_j ,j = 0,1, \cdots ,n - 1$ and $x_n = b$ such that \[ \int_{xj}^{x_{j + 1} } {f \leqq c\quad {\text{and}}\quad \frac{1} {K}} \leqq \frac{{h_{j + 1} }} {{h_j }} \leqq K\quad {\text{for}}\, j = 0,1, \cdots ,n - 1 . \] A theoretical analysis of the procedure is presented, and numerical algorithms for implementing the method are given. Examples show that the procedure is effective in practice. Other types of constraints on equidistributing meshes are also discussed.The principal application of the procedure is to the solution of boundary value problems, where the weight function is generally some error indicator, and accuracy and convergence properties may depend on the smoothness of the mesh. Other practical applications include the regrading of statistical data.

77 citations

Journal ArticleDOI
TL;DR: In this paper, simple Gauss knots are obtained as eigenvalues of symmetric tridiagonal matrices and a rapidly converging simple iterative process, based on the merging of free and fixed knots, of quadratic convergence is presented for multiple Gaussian knots.
Abstract: Algorithms are derived for the evaluation of Gauss knots in the presence of fixed knots by modification of the Jacobi matrix for the weight function of the integral. Simple Gauss knots are obtained as eigenvalues of symmetric tridiagonal matrices and a rapidly converging simple iterative process, based on the merging of free and fixed knots, of quadratic convergence is presented for multiple Gauss knots. The procedures also allow for the evaluation of the weights of the quadrature corresponding to the simple Gauss knots. A new characterization of simple Gauss knots as a solution of a partial inverse eigenvalue problem is derived.

72 citations

Journal ArticleDOI
TL;DR: This paper presents two methods not requiring the explicit knowledge of the roots of r and obtains various properties of the similarity transformations between Jacobi matrices, which are proved by simple matrix calculus without using the generalized Christoffel theorem.

64 citations

Journal ArticleDOI
TL;DR: A new method invariant under rotation that can handle diAerently blurred images and has relatively high number of common elements is presented, which is highly desirable for further multiframe processing.

63 citations

Journal ArticleDOI
TL;DR: New methods for updating and downdating least squares polynomial fits to discrete data using polynomials orthogonal on all the data points being used are derived and assessed.
Abstract: We derive and assess new methods for updating and downdating least squares polynomial fits to discrete data using polynomials orthogonal on all the data points being used. Rather than fixing on one basis throughout, the methods adaptively update and downdate both the least squares fit and the polynomial basis. This is achieved by performing similarity transformations on the tridiagonal Jacobi matrices representing the basis. Although downdating is potentially unstable, experimental results show that the methods give satisfactory results for low degree fits. The most economical of the algorithms implementing the methods needs 14n+ O(1) flops and 2n square roots to update a fit of order n.

59 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: A review of recent as well as classic image registration methods to provide a comprehensive reference source for the researchers involved in image registration, regardless of particular application areas.

6,842 citations

Book
27 Sep 2011
TL;DR: Robust Model-Based Fault Diagnosis for Dynamic Systems targets both newcomers who want to get into this subject, and experts who are concerned with fundamental issues and are also looking for inspiration for future research.
Abstract: There is an increasing demand for dynamic systems to become safer and more reliable This requirement extends beyond the normally accepted safety-critical systems such as nuclear reactors and aircraft, where safety is of paramount importance, to systems such as autonomous vehicles and process control systems where the system availability is vital It is clear that fault diagnosis is becoming an important subject in modern control theory and practice Robust Model-Based Fault Diagnosis for Dynamic Systems presents the subject of model-based fault diagnosis in a unified framework It contains many important topics and methods; however, total coverage and completeness is not the primary concern The book focuses on fundamental issues such as basic definitions, residual generation methods and the importance of robustness in model-based fault diagnosis approaches In this book, fault diagnosis concepts and methods are illustrated by either simple academic examples or practical applications The first two chapters are of tutorial value and provide a starting point for newcomers to this field The rest of the book presents the state of the art in model-based fault diagnosis by discussing many important robust approaches and their applications This will certainly appeal to experts in this field Robust Model-Based Fault Diagnosis for Dynamic Systems targets both newcomers who want to get into this subject, and experts who are concerned with fundamental issues and are also looking for inspiration for future research The book is useful for both researchers in academia and professional engineers in industry because both theory and applications are discussed Although this is a research monograph, it will be an important text for postgraduate research students world-wide The largest market, however, will be academics, libraries and practicing engineers and scientists throughout the world

3,826 citations

Book
14 Aug 1997
TL;DR: This work describes the development of the Basic Multiresolution Wavelet System and some of its components, as well as some of the techniques used to design and implement these systems.
Abstract: 1 Introduction to Wavelets 2 A Multiresolution Formulation of Wavelet Systems 3 Filter Banks and the Discrete Wavelet Transform 4 Bases, Orthogonal Bases, Biorthogonal Bases, Frames, Tight Frames, and Unconditional Bases 5 The Scaling Function and Scaling Coefficients, Wavelet and Wavelet Coefficients 6 Regularity, Moments, and Wavelet System Design 7 Generalizations of the Basic Multiresolution Wavelet System 8 Filter Banks and Transmultiplexers 9 Calculation of the Discrete Wavelet Transform 10 Wavelet-Based Signal Processing and Applications 11 Summary Overview 12 References Bibliography Appendix A Derivations for Chapter 5 on Scaling Functions Appendix B Derivations for Section on Properties Appendix C Matlab Programs Index

2,339 citations

Journal ArticleDOI
TL;DR: This work surveys the quadratic eigenvalue problem, treating its many applications, its mathematical properties, and a variety of numerical solution techniques.
Abstract: We survey the quadratic eigenvalue problem, treating its many applications, its mathematical properties, and a variety of numerical solution techniques. Emphasis is given to exploiting both the structure of the matrices in the problem (dense, sparse, real, complex, Hermitian, skew-Hermitian) and the spectral properties of the problem. We classify numerical methods and catalogue available software.

1,369 citations

Journal ArticleDOI
TL;DR: Numerical methods are described for determining robust, or well-conditioned, solutions to the problem of pole assignment by state feedback such that the sensitivity of the assigned poles to perturbations in the system and gain matrices is minimized.
Abstract: Numerical methods are described for determining robust, or well-conditioned, solutions to the problem of pole assignment by state feedback. The solutions obtained are such that the sensitivity of the assigned poles to perturbations in the system and gain matrices is minimized. It is shown that for these solutions, upper bounds on the norm of the feedback matrix and on the transient response are also minimized and a lower bound on the stability margin is maximized. A measure is derived which indicates the optimal conditioning that may be expected for a particular system with a given set of closed-loop poles, and hence the suitability of the given poles for assignment.

1,035 citations