135 results on '"Harm Bart"'
Search Results
2. Rank decomposition under zero pattern constraints and L-free directed graphs
- Author
-
Harm Bart, Bernd Silbermann, and Torsten Ehrhardt
- Subjects
Numerical Analysis ,Lemma (mathematics) ,Algebra and Number Theory ,Rank (linear algebra) ,Linear space ,010102 general mathematics ,Triangular matrix ,010103 numerical & computational mathematics ,Directed graph ,System of linear equations ,01 natural sciences ,Combinatorics ,Unimodular matrix ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,0101 mathematics ,Integer programming ,Mathematics - Abstract
For a block upper triangular matrix, a necessary and sufficient condition has been given to let it be the sum of block upper rectangular matrices satisfying certain rank constraints; see [12] . The proof involves elements from Integer Programming (totally unimodular systems of equations playing a role in particular) and employs Farkas' Lemma. The linear space of block upper triangular matrices can be viewed as being determined by a special pattern of zeros. The present paper is concerned with the question whether the decomposition result can be extended to situations where other, less restrictive, zero patterns play a role. It is shown that such generalizations do indeed hold for certain directed graphs determining the pattern of zeros. The graphs in question are what will be called L -free. This notion is akin to other graph theoretical concepts available in the literature, among them the one of being N -free in the sense of [16] .
- Published
- 2021
- Full Text
- View/download PDF
3. Unions of rank/trace complete preorders
- Author
-
Harm Bart, Torsten Ehrhardt, and Bernd Silbermann
- Subjects
Numerical Analysis ,Transitive relation ,Algebra and Number Theory ,Logarithm ,010102 general mathematics ,Preorder ,Digraph ,010103 numerical & computational mathematics ,01 natural sciences ,Combinatorics ,Matrix algebra ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Logarithmic derivative ,0101 mathematics ,Mathematics - Abstract
A zero pattern algebra is a matrix algebra determined by a pattern of zeros corresponding to a preorder (i.e., a reflexive transitive digraph). The issue studied in [6] is: under what conditions is a matrix in a zero pattern algebra A a sum of (rank one) idempotents in A or a logarithmic residue in A ? Here logarithmic residues are contour integrals of logarithmic derivatives of analytic A -valued functions. As has been established in [6] , there is a necessary condition involving certain rank/trace requirements. Algebras for which this necessary condition is also sufficient are said to be rank/trace complete. Several classes of rank/trace complete algebras are identified in [6] . Also operations are described there for producing rank/trace complete algebras out of given ones. A basic operation of that type is taking a disjoint union. In the present article this simple operation is generalized to a more involved one which preserves rank/trace completeness too. The new operation turns out to be a useful tool for establishing rank/trace completeness in situations that up to now could not be handled. One of the positive results is concerned with bouquets, a special type of rooted trees. It provides a partial answer to an issue raised in [7] .
- Published
- 2019
- Full Text
- View/download PDF
4. Grassland vertical height heterogeneity predicts flower and bee diversity: an UAV photogrammetric approach
- Author
-
Michele Torresani, Duccio Rocchini, Giada Ceola, Jan Peter Reinier de Vries, Hannes Feilhauer, Vítězslav Moudrý, Harm Bartholomeus, Michela Perrone, Matteo Anderle, Hannes Andres Gamper, Ludovico Chieffallo, Enrico Guatelli, Roberto Cazzolla Gatti, and David Kleijn
- Subjects
Medicine ,Science - Abstract
Abstract The ecosystem services offered by pollinators are vital for supporting agriculture and ecosystem functioning, with bees standing out as especially valuable contributors among these insects. Threats such as habitat fragmentation, intensive agriculture, and climate change are contributing to the decline of natural bee populations. Remote sensing could be a useful tool to identify sites of high diversity before investing into more expensive field survey. In this study, the ability of Unoccupied Aerial Vehicles (UAV) images to estimate biodiversity at a local scale has been assessed while testing the concept of the Height Variation Hypothesis (HVH). This hypothesis states that the higher the vegetation height heterogeneity (HH) measured by remote sensing information, the higher the vegetation vertical complexity and the associated species diversity. In this study, the concept has been further developed to understand if vegetation HH can also be considered a proxy for bee diversity and abundance. We tested this approach in 30 grasslands in the South of the Netherlands, where an intensive field data campaign (collection of flower and bee diversity and abundance) was carried out in 2021, along with a UAV campaign (collection of true color-RGB-images at high spatial resolution). Canopy Height Models (CHM) of the grasslands were derived using the photogrammetry technique “Structure from Motion” (SfM) with horizontal resolution (spatial) of 10 cm, 25 cm, and 50 cm. The accuracy of the CHM derived from UAV photogrammetry was assessed by comparing them through linear regression against local CHM LiDAR (Light Detection and Ranging) data derived from an Airborne Laser Scanner campaign completed in 2020/2021, yielding an $$R^2$$ R 2 of 0.71. Subsequently, the HH assessed on the CHMs at the three spatial resolutions, using four different heterogeneity indices (Rao’s Q, Coefficient of Variation, Berger–Parker index, and Simpson’s D index), was correlated with the ground-based flower and bee diversity and bee abundance data. The Rao’s Q index was the most effective heterogeneity index, reaching high correlations with the ground-based data (0.44 for flower diversity, 0.47 for bee diversity, and 0.34 for bee abundance). Interestingly, the correlations were not significantly influenced by the spatial resolution of the CHM derived from UAV photogrammetry. Our results suggest that vegetation height heterogeneity can be used as a proxy for large-scale, standardized, and cost-effective inference of flower diversity and habitat quality for bees.
- Published
- 2024
- Full Text
- View/download PDF
5. How Small Can a Sum of Idempotents Be?
- Author
-
Torsten Ehrhardt, Bernd Silbermann, and Harm Bart
- Subjects
Pure mathematics ,Algebra and Number Theory ,Logarithm ,Generalization ,Complex algebra ,010102 general mathematics ,Residue theorem ,Order (ring theory) ,01 natural sciences ,Nilpotent ,0103 physical sciences ,010307 mathematical physics ,0101 mathematics ,Banach *-algebra ,Analysis ,Mathematics - Abstract
The issue discussed in this paper is: how small can a sum of idempotents be? Here smallness is understood in terms of nilpotency or quasinilpotency. Thus the question is: given idempotents $$p_1,\ldots ,p_n$$ in a complex algebra or Banach algebra, is it possible that their sum $$p_1+\cdots +p_n$$ is quasinilpotent or (even) nilpotent (of a certain order)? The motivation for considering this problem comes from earlier work by the authors on the generalization of the logarithmic residue theorem from complex function theory to higher (possibly infinite) dimensions.
- Published
- 2020
- Full Text
- View/download PDF
6. TLS2trees: A scalable tree segmentation pipeline for TLS data
- Author
-
Phil Wilkes, Mathias Disney, John Armston, Harm Bartholomeus, Lisa Bentley, Benjamin Brede, Andrew Burt, Kim Calders, Cecilia Chavana‐Bryant, Daniel Clewley, Laura Duncanson, Brieanne Forbes, Sean Krisanski, Yadvinder Malhi, David Moffat, Niall Origo, Alexander Shenkin, and Wanxin Yang
- Subjects
above‐ground biomass ,Forest ,FOSS ,segmentation ,terrestrial laser scanning ,Ecology ,QH540-549.5 ,Evolution ,QH359-425 - Abstract
Abstract Above‐ground biomass (AGB) is an important metric used to quantify the mass of carbon stored in terrestrial ecosystems. For forests, this is routinely estimated at the plot scale (typically 1 ha) using inventory measurements and allometry. In recent years, terrestrial laser scanning (TLS) has appeared as a disruptive technology that can generate a more accurate assessment of tree and plot scale AGB; however, operationalising TLS methods has had to overcome a number of challenges. One such challenge is the segmentation of individual trees from plot level point clouds that are required to estimate woody volume, this is often done manually (e.g. with interactive point cloud editing software) and can be very time consuming. Here we present TLS2trees, an automated processing pipeline and set of Python command line tools that aims to redress this processing bottleneck. TLS2trees consists of existing and new methods and is specifically designed to be horizontally scalable. The processing pipeline is demonstrated on 7.5 ha of TLS data captured across 10 plots of seven forest types; from open savanna to dense tropical rainforest. A total of 10,557 trees are segmented with TLS2trees: these are compared to 1281 manually segmented trees. Results indicate that TLS2trees performs well, particularly for larger trees (i.e. the cohort of largest trees that comprise 50% of total plot volume), where plot‐wise tree volume bias is ±0.4 m3 and %RMSE is 60%. Segmentation performance decreases for smaller trees, for example where DBH ≤10 cm; a number of reasons are suggested including performance of semantic segmentation step. The volume and scale of TLS data captured in forest plots is increasing. It is suggested that to fully utilise this data for activities such as monitoring, reporting and verification or as reference data for satellite missions an automated processing pipeline, such as TLS2trees, is required. To facilitate improvements to TLS2trees, as well as modification for other laser scanning modes (e.g. mobile and UAV laser scanning), TLS2trees is a free and open‐source software.
- Published
- 2023
- Full Text
- View/download PDF
7. StrucNet: a global network for automated vegetation structure monitoring
- Author
-
Kim Calders, Benjamin Brede, Glenn Newnham, Darius Culvenor, John Armston, Harm Bartholomeus, Anne Griebel, Jodie Hayward, Samuli Junttila, Alvaro Lau, Shaun Levick, Rosalinda Morrone, Niall Origo, Marion Pfeifer, Jan Verbesselt, and Martin Herold
- Subjects
Automation ,ecosystem structure ,essential biodiversity variables ,lidar ,monitoring ,vegetation structure monitoring ,Technology ,Ecology ,QH540-549.5 - Abstract
Abstract Climate change and increasing human activities are impacting ecosystems and their biodiversity. Quantitative measurements of essential biodiversity variables (EBV) and essential climate variables are used to monitor biodiversity and carbon dynamics and evaluate policy and management interventions. Ecosystem structure is at the core of EBVs and carbon stock estimation and can help to inform assessments of species and species diversity. Ecosystem structure is also used as an indirect indicator of habitat quality and expected species richness or species community composition. Spaceborne measurements can provide large‐scale insight into monitoring the structural dynamics of ecosystems, but they generally lack consistent, robust, timely and detailed information regarding their full three‐dimensional vegetation structure at local scales. Here we demonstrate the potential of high‐frequency ground‐based laser scanning to systematically monitor structural changes in vegetation. We present a proof‐of‐concept high‐temporal ecosystem structure time series of 5 years in a temperate forest using terrestrial laser scanning (TLS). We also present data from automated high‐temporal laser scanning that can allow upscaling of vegetation structure scanning, overcoming the limitations of a typically opportunistic TLS measurement approach. Automated monitoring will be a critical component to build a network of field monitoring sites that can provide the required calibration data for satellite missions to effectively monitor the structural dynamics of vegetation over large areas. Within this perspective, we reflect on how this network could be designed and discuss implementation pathways.
- Published
- 2023
- Full Text
- View/download PDF
8. Rank decomposition in zero pattern matrix algebras
- Author
-
Harm Bart, Bernd Silbermann, and Torsten Ehrhardt
- Subjects
Discrete mathematics ,Lemma (mathematics) ,Rank (linear algebra) ,General Mathematics ,010102 general mathematics ,0211 other engineering and technologies ,Zero (complex analysis) ,Triangular matrix ,021107 urban & regional planning ,02 engineering and technology ,Disjoint sets ,01 natural sciences ,Matrix decomposition ,Combinatorics ,Matrix (mathematics) ,Zero matrix ,0101 mathematics ,Mathematics - Abstract
For a block upper triangular matrix, a necessary and sufficient condition has been given to let it be the sum of block upper rectangular matrices satisfying certain rank constraints; see H.Bart, A.P.M.Wagelmans (2000). The proof involves elements from integer programming and employs Farkas’ lemma. The algebra of block upper triangular matrices can be viewed as a matrix algebra determined by a pattern of zeros. The present note is concerned with the question whether the decomposition result referred to above can be extended to other zero pattern matrix algebras. It is shown that such a generalization does indeed hold for certain digraphs determining the pattern of zeros. The digraphs in question can be characterized in terms of forests, i.e., disjoint unions of rooted trees.
- Published
- 2016
- Full Text
- View/download PDF
9. Sums of idempotents and logarithmic residues in zero pattern matrix algebras
- Author
-
Bernd Silbermann, Harm Bart, and Torsten Ehrhardt
- Subjects
Numerical Analysis ,Algebra and Number Theory ,Logarithm ,010102 general mathematics ,Subalgebra ,0211 other engineering and technologies ,021107 urban & regional planning ,02 engineering and technology ,01 natural sciences ,Combinatorics ,Zero matrix ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Logarithmic derivative ,0101 mathematics ,Mathematics - Abstract
A zero pattern algebra is a matrix subalgebra of C n × n determined by a pattern of zeros. The issue in this paper is: under what conditions is a matrix in a zero pattern algebra A a sum of (rank one) idempotents in A or a logarithmic residue in A ? Here logarithmic residues are contour integrals of logarithmic derivatives of analytic A -valued functions. It turns out that there is a necessary condition involving certain rank/trace requirements. Although these requirements are generally not sufficient, there are several important cases where they are.
- Published
- 2016
- Full Text
- View/download PDF
10. Operator Theory, Analysis and the State Space Approach : In Honor of Rien Kaashoek
- Author
-
Harm Bart, Sanne ter Horst, André C.M. Ran, Hugo J. Woerdeman, Harm Bart, Sanne ter Horst, André C.M. Ran, and Hugo J. Woerdeman
- Subjects
- Operator theory
- Abstract
This volume is dedicated to Rien Kaashoek on the occasion of his 80th birthday and celebrates his many contributions to the field of operator theory during more than fifty years. In the first part of the volume, biographical information and personal accounts on the life of Rien Kaashoek are presented. Eighteen research papers by friends and colleagues of Rien Kaashoek are included in the second part. Contributions by J. Agler, Z.A. Lykova, N.J. Young, J.A. Ball, G.J. Groenewald, S. ter Horst, H. Bart, T. Ehrhardt, B. Silbermann, J.M. Bogoya, S.M. Grudsky, I.S. Malysheva, A. Böttcher, E. Wegert, Z. Zhou, Y. Eidelman, I. Haimovici, A.E. Frazho, A.C.M. Ran, B. Fritzsche, B. Kirstein, C.Madler, J. J. Jaftha, D.B. Janse van Rensburg, P. Junghanns, R. Kaiser, J. Nemcova, M. Petreczky, J.H. van Schuppen, L. Plevnik, P. Semrl, A. Sakhnovich, F.-O. Speck, S. Sremac, H.J. Woerdeman, H. Wolkowicz and N. Vasilevski.
- Published
- 2018
11. Approximately finite-dimensional Banach algebras are spectrally regular
- Author
-
Bernd Silbermann, Harm Bart, and Torsten Ehrhardt
- Subjects
Discrete mathematics ,Numerical Analysis ,Pure mathematics ,Algebra and Number Theory ,Banach algebra ,Bounded function ,Domain (ring theory) ,Algebra representation ,Division algebra ,Discrete Mathematics and Combinatorics ,Cellular algebra ,Geometry and Topology ,Logarithmic derivative ,Composition algebra ,Mathematics - Abstract
Let B be a unital Banach algebra, which can in a certain sense be approximated by finite dimensional algebras. For instance, AF C ⁎ -algebras belong to this class. Further, let f be an analytic function on some bounded Cauchy domain Δ with values in B and suppose that the contour integral of the logarithmic derivative f ′ ( λ ) f − 1 ( λ ) along the positively oriented boundary ∂Δ vanishes (or is even only quasinilpotent). We prove that then f takes invertible values on all of Δ. This means that such Banach algebras are spectrally regular.
- Published
- 2015
- Full Text
- View/download PDF
12. Spectral regularity of a C*-algebra generated by two-dimensional singular integral operators
- Author
-
Bernd Silbermann, Harm Bart, and Torsten Ehrhardt
- Subjects
Algebra ,Physics ,symbols.namesake ,Bounded function ,Domain (ring theory) ,Simply connected space ,Hilbert space ,symbols ,Boundary (topology) ,Logarithmic derivative ,Singular integral ,Compact operator - Abstract
Given a bounded simply connected domain \({U} \subset {\mathbb{C}}\) having a Lyapunov curve as its boundary, let \(\mathcal{L}({L}^{2}(U))\) stand for the \((\mathbb{c}^\ast)\) -algebra of all bounded linear operators acting on the Hilbert space \(\mathcal{L}^{2}(U)\) with Lebesgue area measure. We show that the smallest C*-subalgebra \(\mathcal{A}\) of \(\mathcal{L}({L}^{2}(U))\) containing the singular integral operator $$(S_Uf)(z)\;=\;-\frac{1}{\pi}{\int\limits_{U}}\frac{f(w)}{(z-w)^2}dA(w),$$ along with its adjoint $$(S^*_Uf)(z)\;=\;-\frac{1}{\pi}{\int\limits_{U}}\frac{f(w)}{(z-w)^2}dA(w)$$ all multiplication operators \(aI, a \in\; C(\overline{U})\), and all compact operators on \(\mathcal{L}^{2}(U)\), is spectrally regular. Roughly speaking the latter means the following: if the contour integral of the logarithmic derivative of an analytic \(\mathcal{A}\)-valued function f is vanishing (or is quasi-nilpotent), then f takes invertible values on the inner domain of the contour in question.
- Published
- 2018
- Full Text
- View/download PDF
13. L-free directed bipartite graphs and echelon-type canonical forms
- Author
-
Harm Bart, Torsten Ehrhardt, and Bernd Silbermann
- Subjects
Combinatorics ,Matrix (mathematics) ,symbols.namesake ,Gaussian elimination ,Triangular matrix ,Bipartite graph ,symbols ,Canonical form ,Graph ,Row echelon form ,Mathematics - Abstract
It is common knowledge that matrices can be brought in echelon form by Gaussian elimination and that the reduced echelon form of a matrix is canonical in the sense that it is unique. In [4], working within the context of the algebra \( \mathbb{C}^{n\times n}_{\mathrm{upper}}\) of upper triangular n×n matrices, certain new canonical forms of echelon-type have been introduced. Subalgebras of \( \mathbb{C}^{n\times n}_{\mathrm{upper}}\) determined by a pattern of zeros have been considered too. The issue there is whether or not those subalgebras are echelon compatible in the sense that the new canonical forms belong to the subalgebras in question. In general they don’t, but affirmative answers were obtained under certain conditions on the given zero pattern. In the present paper these conditions are weakened. Even to the extent that a further relaxation is not possible because the conditions involved are not only sufficient but also necessary. The results are used to study equivalence classes in \( \mathbb{C}^{m\times n}\) associated with zero patterns. The analysis of the pattern of zeros referred to above is done in terms of graph theoretical notions.
- Published
- 2018
- Full Text
- View/download PDF
14. Combining acoustic tracking and LiDAR to study bat flight behaviour in three-dimensional space
- Author
-
Claire Hermans, Jens C. Koblitz, Harm Bartholomeus, Peter Stilz, Marcel E. Visser, and Kamiel Spoelstra
- Subjects
Acoustic localisation ,Bats ,Flight behaviour ,LiDAR ,Microphone arrays ,Terrestrial laser scanning ,Biology (General) ,QH301-705.5 - Abstract
Abstract Background Habitat structure strongly influences niche differentiation, facilitates predator avoidance, and drives species-specific foraging strategies of bats. Vegetation structure is also a strong driver of echolocation call characteristics. The fine-scale assessment of how bats utilise such structures in their natural habitat is instrumental in understanding how habitat composition shapes flight- and acoustic behaviour. However, it is notoriously difficult to study their species-habitat relationship in situ. Methods Here, we describe a methodology combining Light Detection and Ranging (LiDAR) to characterise three-dimensional vegetation structure and acoustic tracking to map bat behaviour. This makes it possible to study fine-scale use of habitat by bats, which is essential to understand spatial niche segregation in bats. Bats were acoustically tracked with microphone arrays and bat calls were classified to bat guild using automated identification. We did this in multiple LiDAR scanned vegetation plots in forest edge habitat. The datasets were spatially aligned to calculate the distance between bats’ positions and vegetation structures. Results Our results are a proof of concept of combining LiDAR with acoustic tracking. Although it entails challenges with combining mass-volumes of fine-scale bat movements and vegetation information, we show the feasibility and potential of combining those two methods through two case studies. The first one shows stereotyped flight patterns of pipistrelles around tree trunks, while the second one presents the distance that bats keep to the vegetation in the presence of artificial light. Conclusion By combining bat guild specific spatial behaviour with precise information on vegetation structure, the bat guild specific response to habitat characteristics can be studied in great detail. This opens up the possibility to address yet unanswered questions on bat behaviour, such as niche segregation or response to abiotic factors in interaction with natural vegetation. This combination of techniques can also pave the way for other applications linking movement patterns of other vocalizing animals and 3D space reconstruction.
- Published
- 2023
- Full Text
- View/download PDF
15. Analysing individual 3D tree structure using the R package ITSMe
- Author
-
Louise Terryn, Kim Calders, Markku Åkerblom, Harm Bartholomeus, Mathias Disney, Shaun Levick, Niall Origo, Pasi Raumonen, and Hans Verbeeck
- Subjects
LiDAR ,quantitative structure models ,R package ,tree structural metrics ,Ecology ,QH540-549.5 ,Evolution ,QH359-425 - Abstract
Abstract Detailed 3D quantification of tree structure plays a crucial role in understanding tree‐ and plot‐level biophysical processes. Light detection and ranging (LiDAR) has led to a revolution in tree structural measurements and its 3D data are increasingly becoming publicly available. Yet, calculating structural metrics from LiDAR data can often be complex and time‐consuming and potentially requires expert knowledge. We present the R package Individual Tree Structural Metrics (ITSMe), a toolbox that works with LiDAR tree point clouds and quantitative structure models (QSMs) derived from LiDAR point clouds to obtain individual tree structural metrics. It serves as a robust synthesis framework for researchers who want to readily obtain structural information from 3D data of individual trees. The package includes functions to determine basic structural metrics (tree height, diameter at breast height, diameter above buttresses, projected crown area, 3D alpha crown volume) from individual tree point clouds, as well as more complex structural metrics (individual tree component volumes, branch angle‐, radius‐ and length‐related metrics) from QSMs. The ITSMe package is an open‐source package hosted on GitHub that will make the use of 3D data more straightforward and transparent for a range of end‐users interested in exploiting tree structure information.
- Published
- 2023
- Full Text
- View/download PDF
16. Echelon Type Canonical Forms in Upper Triangular Matrix Algebras
- Author
-
Bernd Silbermann, Harm Bart, and Torsten Ehrhardt
- Subjects
Combinatorics ,Triangular matrix ,Canonical normal form ,Stirling numbers of the second kind ,Canonical form ,Connection (algebraic framework) ,Type (model theory) ,Hermite normal form ,Row echelon form ,Mathematics - Abstract
It is common knowledge that matrices can be brought in echelon form by Gaussian elimination and that the reduced echelon form of a matrix is canonical (also) in the sense that it is unique. A crucial auxiliary result in [BW] suggests a generalization of the standard echelon form. For square matrices, some new canonical forms of echelon type are introduced. One of them (suggested by observations made in [Lay] and [SW]) has the important property of being an upper triangular idempotent. The others come up when working exclusively in the context of \( \mathbb{C}^{n \times n}_{upper} \), the algebra of upper triangular n × n matrices. Subalgebras of \( \mathbb{C}^{n \times n}_{upper} \) determined by a pattern of zeros are considered too. The issue there is whether or not the canonical forms referred to above belong to the subalgebras in question. In general they do not, but affirmative answers are obtained under certain conditions on the given preorder which allow for a large class of examples and that also came up in [BES4]. Similar results hold for canonical generalized diagonal forms involving matrices for which all columns and rows contain at most one nonzero entry. The new canonical forms are used to study left, right and left/right equivalence in zero pattern algebras. For the archetypical full upper triangular case a connection with the Stirling numbers (of the second kind) and with the Bell numbers is made.
- Published
- 2017
- Full Text
- View/download PDF
17. The Chemnitz connection
- Author
-
Harm Bart and Econometrics
- Subjects
Algebra ,Numerical Analysis ,Algebra and Number Theory ,Logarithm ,Group (mathematics) ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Banach *-algebra ,Connection (mathematics) ,Mathematics - Abstract
It is described how my contacts with a group of functional analysts in Chemnitz (Germany) came along and resulted in a longstanding cooperation on logarithmic residues and spectral regularity in a Banach algebra setting.
- Published
- 2013
- Full Text
- View/download PDF
18. Logarithmic residues, Rouché’s theorem, and spectral regularity: The C∗-algebra case
- Author
-
Harm Bart, Torsten Ehrhardt, and Bernd Silbermann
- Subjects
Mathematics::Operator Algebras ,General Mathematics ,Fredholm operator ,010102 general mathematics ,Hilbert space ,010103 numerical & computational mathematics ,Function (mathematics) ,Fredholm integral equation ,16. Peace & justice ,01 natural sciences ,Fredholm theory ,Algebra ,symbols.namesake ,symbols ,Isometry ,Rouché's theorem ,Calkin algebra ,0101 mathematics ,Mathematics - Abstract
Using families of irreducible Hilbert space representations as a tool, the theory of analytic Fredholm operator valued function is extended to a C ∗ -algebra setting. This includes a C ∗ -algebra version of Rouche’s Theorem known from complex function theory. Also, criteria for spectral regularity of C ∗ -algebras are developed. One of those, involving the (generalized) Calkin algebra, is applied to C ∗ -algebras generated by a non-unitary isometry.
- Published
- 2012
- Full Text
- View/download PDF
19. Book review
- Author
-
Harm Bart
- Subjects
Numerical Analysis ,Algebra and Number Theory ,French horn ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Humanities ,Mathematics - Published
- 2015
- Full Text
- View/download PDF
20. In memoriam Israel Gohberg August 23, 1928–October 12, 2009
- Author
-
Leiba Rodman, Harm Bart, Harry Dym, Rien Kaashoek, Alexander Markus, and Peter Lancaster
- Subjects
History of mathematics ,realization ,Fredholm theory ,State space method in analysis ,Band method ,Singular integral equations ,Perturbation theory ,Indefinite scalar products ,symbols.namesake ,Partially specified matrices ,Systems theory ,Factorization ,Maximum entropy extensions ,Calculus ,Discrete Mathematics and Combinatorics ,Toeplitz operators ,Mathematics ,Numerical Analysis ,Algebra and Number Theory ,Matrix and operator polynomials ,Rational matrix functions ,Obituary ,Algebra ,Interpolation problems ,Wiener–Hopf integral equations ,symbols ,Geometry and Topology ,Realization (systems) - Abstract
This obituary for Israel Gohberg consists of a general introduction, separate contributions of the six authors, all of whom worked closely with him, and a final note. The material gives an impression of the life of this great mathematician, of his monumental impact in the areas he worked in, of how he cooperated with colleagues, and of his ability to stimulate people in their mathematical activities.
- Published
- 2010
- Full Text
- View/download PDF
21. Trace conditions for regular spectral behavior of vector-valued analytic functions
- Author
-
Bernd Silbermann, Harm Bart, Torsten Ehrhardt, Econometrics, and Erasmus School of Economics
- Subjects
Discrete mathematics ,Numerical Analysis ,Algebra and Number Theory ,Fredholm operator ,Plain function ,Banach space ,Logarithmic residue ,law.invention ,Resolving family of traces ,Invertible matrix ,Analytic vector-valued function ,law ,Idempotent ,Annihilating family of idempotents ,Integer combination of idempotents ,Idempotence ,Discrete Mathematics and Combinatorics ,Elementary factor ,Geometry and Topology ,Idempotent matrix ,Mathematics ,Resolvent ,Meromorphic function ,Analytic function - Abstract
A new class of Banach algebra valued functions is identified for which the logarithmic residue with respect to a Cauchy domain Δ vanishes (if and) only if the functions take invertible values in Δ . Trace conditions and the extraction of elementary factors of the type e - p + ( λ - α ) p play an important role. The class contains the Fredholm operator valued functions and the Banach algebra valued functions possessing a simply meromorphic resolvent as special instances. An example is given to show that new ground is covered and a long standing open problem is discussed from a fresh angle.
- Published
- 2009
22. Preface
- Author
-
Harm Bart, Alexander Markus, I. Koltracht, and Leiba Rodman
- Subjects
Filtered algebra ,Algebra ,Numerical Analysis ,Algebra and Number Theory ,Linear algebra ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Mathematics - Published
- 2004
- Full Text
- View/download PDF
23. Logarithmic residues in the Banach algebra generated by the compact operators and the identity
- Author
-
Harm Bart, Torsten Ehrhardt, Bernd Silbermann, and Erasmus School of Economics
- Subjects
Discrete mathematics ,Pure mathematics ,Approximation property ,General Mathematics ,Idempotence ,Banach space ,Logarithmic derivative ,Compact operator ,Methods of contour integration ,Analytic function ,Logarithmic form ,Mathematics - Abstract
A logarithmic residue is a contour integral of the (left or right) logarithmic derivative of an analytic Banach algebra valued function. Logarithmic residues are intimately related to sums of idempotents. The present paper is concerned with logarithmic residues in a specific Banach algebra, namely the one generated by the compact operators and the identity in the case when the underlying Banach space is infinite dimensional. The situation is more complex than encountered in previous investigations concerning logarithmic residues. Logarithmic derivatives may have essential singularities and the geometric properties of the Banach space play a role. Topological properties of the set of logarithmic residues are considered too. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
- Published
- 2004
- Full Text
- View/download PDF
24. 3D data-augmentation methods for semantic segmentation of tomato plant parts
- Author
-
Bolai Xin, Ji Sun, Harm Bartholomeus, and Gert Kootstra
- Subjects
data augmentation ,deep learning ,point clouds ,semantic segmentation ,tomato plants ,Plant culture ,SB1-1110 - Abstract
Introduction3D semantic segmentation of plant point clouds is an important step towards automatic plant phenotyping and crop modeling. Since traditional hand-designed methods for point-cloud processing face challenges in generalisation, current methods are based on deep neural network that learn to perform the 3D segmentation based on training data. However, these methods require a large annotated training set to perform well. Especially for 3D semantic segmentation, the collection of training data is highly labour intensitive and time consuming. Data augmentation has been shown to improve training on small training sets. However, it is unclear which data-augmentation methods are effective for 3D plant-part segmentation.MethodsIn the proposed work, five novel data-augmentation methods (global cropping, brightness adjustment, leaf translation, leaf rotation, and leaf crossover) were proposed and compared to five existing methods (online down sampling, global jittering, global scaling, global rotation, and global translation). The methods were applied to PointNet++ for 3D semantic segmentation of the point clouds of three cultivars of tomato plants (Merlice, Brioso, and Gardener Delight). The point clouds were segmented into soil base, stick, stemwork, and other bio-structures.Results and disccusionAmong the data augmentation methods being proposed in this paper, leaf crossover indicated the most promising result which outperformed the existing ones. Leaf rotation (around Z axis), leaf translation, and cropping also performed well on the 3D tomato plant point clouds, which outperformed most of the existing work apart from global jittering. The proposed 3D data augmentation approaches significantly improve the overfitting caused by the limited training data. The improved plant-part segmentation further enables a more accurate reconstruction of the plant architecture.
- Published
- 2023
- Full Text
- View/download PDF
25. A novel approach for surveying flowers as a proxy for bee pollinators using drone images
- Author
-
Michele Torresani, David Kleijn, Jan Peter Reinier de Vries, Harm Bartholomeus, Ludovico Chieffallo, Roberto Cazzolla Gatti, Vítězslav Moudrý, Daniele Da Re, Enrico Tomelleri, and Duccio Rocchini
- Subjects
Bees ,Biodiversity ,Flowering plants ,Machine learning ,Monitoring ,Spatial resolution ,Ecology ,QH540-549.5 - Abstract
The abundance and diversity of plants and insects are important indicators of biodiversity, overall ecosystem health and agricultural production. Bees in particular are interesting indicators as they provide a key ecosystem service in many agricultural crops. Worldwide, habitat loss and fragmentation, agricultural intensification and climate change are important drivers of plant and bee decline. Monitoring of plants and bees is a crucial first step to safeguard their diversity and the services they provide but traditional in situ methods are time consuming and expensive. Remote sensing and Earth observation have the advantages that they can cover large areas and provides repeated, spatially continuous and standardized information. However, to date it has proven challenging to use these methods to assess small-scaled species-level biodiversity components with this approach. Here we surveyed bees and flowering plants using conventional field methods in 30 grasslands along a land-use intensity gradient in the Southeast of the Netherlands. We took RGB (true colored Red-Green–Blue) images using an Unmanned Aerial Vehicle (UAV) from the same fields and tested whether remote sensing can provide accurate assessments of flower cover and diversity and, by association, bee abundance and diversity. We explored the performance of different machine learning methods: Random Forest (RF), Neural Networks (NNET) and Support-Vector Machine (SVM). To evaluate the effect of the spatial resolution on the accuracy of the estimates, we tested all approaches using images at the original spatial resolution (∼ 0.5 cm) and re-sampled at 1 cm, 2 cm and 5 cm. We generally found significant relationships between UAV RGB derived estimates of flower cover and in situ estimates of flower cover and bee abundance and diversity. The highest resolution images generally resulted in the strongest relationships, with RF and NNET methods producing considerably better results than SVM methods (flower cover RF R2 = 0.8, NNET R2 = 0.79; bee abundance RF R2 = 0.65, NNET R2 = 0.54, bee species richness RF R2 = 0.62, NNET R2 = 0.52; bee species diversity RF R2 = 0.54, NNET R2 = 0.46). Our results suggest that methods based on the coupling of UAV imagery and machine learning methods can be developed into valuable tools for large-scale, standardized and cost-effective monitoring of flower cover and therefore of an important aspect of habitat quality for bees.
- Published
- 2023
- Full Text
- View/download PDF
26. Book Review
- Author
-
Harm Bart
- Subjects
Numerical Analysis ,Algebra and Number Theory ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Humanities ,Mathematics - Published
- 2010
- Full Text
- View/download PDF
27. An integer programming problem and rank decomposition of block upper triangular matrices
- Author
-
Harm Bart, Albert Wagelmans, and Erasmus School of Economics
- Subjects
Discrete mathematics ,Lemma (mathematics) ,Numerical Analysis ,Algebra and Number Theory ,Rank (linear algebra) ,Triangular matrix ,Block matrix ,Integer programming ,Additive decomposition ,Farkas' Lemma ,Block upper triangular matrices ,Combinatorics ,Unimodular matrix ,Block (programming) ,Rank constraints ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Farkas' lemma ,Mathematics - Abstract
A necessary and sufficient condition is given for a block upper triangular matrix A to be the sum of block upper rectangular matrices satisfying certain rank constraints. The condition is formulated in terms of the ranks of certain submatrices of A. The proof goes by reduction to an integer programming problem. This integer programming problem has a totally unimodular constraint matrix which makes it possible to utilize Farkas' Lemma.
- Published
- 2000
- Full Text
- View/download PDF
28. Less is more: Optimizing vegetation mapping in peatlands using unmanned aerial vehicles (UAVs)
- Author
-
Jasper Steenvoorden, Harm Bartholomeus, and Juul Limpens
- Subjects
Peatlands ,Vegetation patterns ,unmanned aerial vehicles (UAVs) ,Heterogeneous landscapes ,Remote sensing ,Machine learning ,Physical geography ,GB3-5030 ,Environmental sciences ,GE1-350 - Abstract
1. Northern peatlands are inaccessible wetlands that serve important ecosystem services to humans, including climate regulation by storing and sequestering carbon. Unmanned aerial vehicles or drones are ideal to map vegetation and associated functions in these ecosystems, but standardized methods to optimize efficiency (highest accuracy with lowest processing time) are lacking. 2. We collected high-resolution drone imagery at three different altitudes (20 m, 60 m, and 120 m) of two Irish peatlands contrasting in pattern complexity and evaluated to what extent classification accuracy of vegetation patterns (microforms and plant functional types) changed using different flight altitudes, minimum segment size and training/testing sample size. We also analysed the processing time of all classifications to find the most efficient combination of parameters. 3. Classification accuracy was consistently high (>90 %) and estimated areas of both patterns were uniform among all flight altitudes, independent of pattern complexity. Minimum segment size and training/testing sample size were also important parameters affecting the efficiency of classifications. Total processing time from imagery capture to final map was 19–22 times faster with drone imagery at 120 m altitude than at 20 m, and seven times faster than at 60 m. 4. Our findings suggest that flying at the maximum legal altitude of 120 m is the most efficient approach for landscape-scale mapping of vegetation in peatlands or other ecosystems with similar short vegetation structure. We conclude that flying higher is always more efficient as long as the pixel size of drone imagery remains under the pixel size of the pattern under investigation.
- Published
- 2023
- Full Text
- View/download PDF
29. Quasicomplete factorization and the two machine flow shop problem
- Author
-
Harm Bart, Leo Kroon, Rob Zuidwijk, Erasmus School of Economics, and Department of Technology and Operations Management
- Subjects
Numerical Analysis ,Algebra and Number Theory ,Degree (graph theory) ,Job shop scheduling ,Flow shop scheduling ,Congruence of squares ,Two machine flow shop problem ,Algebra ,Factorization ,Rational matrix function ,Simple (abstract algebra) ,Matrix function ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Dixon's factorization method ,Mathematics - Abstract
A connection is made between the Two Machine Flow Shop Problem (2MFSP) from job scheduling theory and the issue of quasicomplete factorization of rational matrix functions. A quasicomplete factorization is a factorization into elementary (i.e., degree one) factors such that the number of factors is minimal. For a companion based matrix function W, the number of factors in a quasicomplete factorization of W is related in a simple way to the minimum makespan of an instance J of 2MFSP which can be associated to W. As a consequence of this result, variants of the 2MFSP and other types of factorization can be related too.
- Published
- 1998
- Full Text
- View/download PDF
30. Logarithmic residues, generalized idempotents, and sums of idempotents in Banach algebras
- Author
-
Bernd Silbermann, Torsten Ehrhardt, Harm Bart, and Erasmus School of Economics
- Subjects
Discrete mathematics ,Pure mathematics ,Polynomial ,Algebra and Number Theory ,Logarithm ,Integer ,Simple (abstract algebra) ,Logarithmic derivative ,Function (mathematics) ,Commutative property ,Methods of contour integration ,Analysis ,Mathematics - Abstract
In a commutative Banach algebraB the set of logarithmic residues (i.e., the elements that can be written as a contour integral of the logarithmic derivative of an analyticB-valued function), the set of generalized idempotents (i.e., the elements that are annihilated by a polynomial with non-negative integer simple zeros), and the set of sums of idempotents are all the same. Also, these (coinciding) sets consist of isolated points only and are closed under the operations of addition and multiplication. Counterexamples show that the commutativity condition onB is essential. The results extend to logarithmic residues of meromorphicB-valued functions.
- Published
- 1997
- Full Text
- View/download PDF
31. Factorization and job scheduling: A connection via companion based matrix functions
- Author
-
Leo Kroon, Harm Bart, Erasmus School of Economics, and Rotterdam School of Management
- Subjects
Discrete mathematics ,State-transition matrix ,Job scheduler ,Numerical Analysis ,Algebra and Number Theory ,Flow shop scheduling ,computer.software_genre ,Matrix decomposition ,Algebra ,Factorization ,Matrix function ,Discrete Mathematics and Combinatorics ,Logical matrix ,Geometry and Topology ,computer ,Eigendecomposition of a matrix ,Mathematics - Abstract
A connection is made between two sets of problems. The first set involves factorization problems of specific rational matrix functions, the companion based matrix functions. The second set is concerned with variants of the two machine flow shop problem (2MFSP) from job scheduling theory. In particular, it is shown that with each companion based matrix function one can associate an instance of 2MFSP and vice versa. The latter can be done in such a way that the factorization properties of the companion based matrix function correspond to the combinatorial properties of the instance of 2MFSP.
- Published
- 1996
- Full Text
- View/download PDF
32. Variants of the Two Machine Flow Shop Problem connected with factorization of matrix functions
- Author
-
Leo Kroon and Harm Bart
- Subjects
Job scheduler ,Schedule ,Mathematical optimization ,Information Systems and Management ,General Computer Science ,Job shop scheduling ,Structure (category theory) ,Flow shop scheduling ,Management Science and Operations Research ,computer.software_genre ,Industrial and Manufacturing Engineering ,Permutation ,Factorization ,Modeling and Simulation ,Matrix function ,Computer Science::Operating Systems ,computer ,Mathematics - Abstract
In this paper we consider a number of variants of the Two Machine Flow Shop Problem. In these variants the makespan is given and the problem is to find a schedule that meets this makespan, thereby minimizing the infeasibilities of the jobs in a prescribed sense: In the max-variant the maximum infeasibility of the jobs is to be minimized, whereas in the sum-variant the objective is to minimize the sum of the infeasibilities of the jobs. For both variants observations about the structure of the optimal schedules are presented. In particular, it is proved that every instance of these problems has an optimal permutation schedule. It is also shown that the max-variant can be solved by Johnson's Rule. For the sum-variant this is not the case: For solving this problem to optimality something quite different is necessary. Both variants are connected with factorization problems for certain rational matrix functions. The factorizations involved are optimal in some sense and generalize the notion of complete factorization. In this way a connection is established between job scheduling theory on one hand, and mathematical systems theory on the other.
- Published
- 1996
- Full Text
- View/download PDF
33. Zero Sums of Idempotents and Banach Algebras Failing to be Spectrally Regular
- Author
-
Bernd Silbermann, Harm Bart, and Torsten Ehrhardt
- Subjects
Large class ,Mathematics::Functional Analysis ,Pure mathematics ,Class (set theory) ,Cuntz algebra ,Direct sum ,Banach space ,Zero (complex analysis) ,Of the form ,Mathematics - Abstract
A large class of Banach algebras is identified allowing for non-trivial zero sums of idempotents, hence failing to be spectrally regular. Belonging to it are the C*-algebras known under the name Cuntz algebras. Other Banach algebras lying in the class are those of the form L(X) with X a (non-trivial) Banach space isomorphic to a (finite) direct sum of at least two copies of X. There do exist (somewhat exotic) Banach spaces for which L(X) is spectrally regular.
- Published
- 2013
- Full Text
- View/download PDF
34. Families of Homomorphisms in Non-commutative Gelfand Theory: Comparisons and Examples
- Author
-
Torsten Ehrhardt, Harm Bart, and Bernd Silbermann
- Subjects
Discrete mathematics ,Matrix (mathematics) ,Pure mathematics ,Banach algebra ,Matrix representation ,Homomorphism ,Commutative property ,Mathematics - Abstract
In non-commutative Gelfand theory, families of Banach algebra homomorphisms, and particularly families of matrix representations, play an important role.D epending on the properties imposed on them, they are called sufficient, weakly sufficient, partially weakly sufficient, radical-separating or separating.I n this paper these families are compared with one another. Conditions are given under which the defining properties amount to the same. Where applicable, examples are presented to show that they are genuinely different.
- Published
- 2012
- Full Text
- View/download PDF
35. Spectral Regularity of Banach Algebras and Non-commutative Gelfand Theory
- Author
-
Harm Bart, Torsten Ehrhardt, and Bernd Silbermann
- Subjects
Pure mathematics ,Gelfand–Naimark theorem ,Type (model theory) ,Commutative property ,Analytic function ,Mathematics - Abstract
A new non-commutative Gelfand type criterion for spectrally regular behavior of vector-valued analytic functions is developed. Applications are given in situations that could not be handled with earlier methods. Some open problems are identified.
- Published
- 2012
- Full Text
- View/download PDF
36. Logarithmic residues in Banach algebras
- Author
-
Harm Bart, Torsten Ehrhardt, Bernd Silbermann, and Erasmus School of Economics
- Subjects
Discrete mathematics ,Pure mathematics ,Algebra and Number Theory ,Zero (complex analysis) ,Methods of contour integration ,law.invention ,Invertible matrix ,law ,Banach algebra ,Domain (ring theory) ,Convex cone ,Logarithmic derivative ,Analysis ,Counterexample ,Mathematics - Abstract
textabstractLet f be an analytic Banach algebra valued function and suppose that the contour integral of the logarithmic derivative f′f-1 around a Cauchy domain D vanishes. Does it follow that f takes invertible values on all of D? For important classes of Banach algebras, the answer is positive. In general, however, it is negative. The counterexample showing this involves a (nontrivial) zero sum of logarithmic residues (that are in fact idempotents). The analysis of such zero sums leads to results about the convex cone generated by the logarithmic residues.
- Published
- 1994
- Full Text
- View/download PDF
37. Zero sums of idempotents in banach algebras
- Author
-
Bernd Silbermann, Harm Bart, Torsten Ehrhardt, and Erasmus School of Economics
- Subjects
Discrete mathematics ,Pure mathematics ,Algebra and Number Theory ,Approximation property ,Norm (mathematics) ,Bounded function ,Banach manifold ,Algebraic number ,Analysis ,Separable hilbert space ,Mathematics ,Counterexample - Abstract
The problem treated in this paper is the following.Let p 1,...,p k be idempotents in a Banach algebra B, and assume p 1+...+p k =0.Does it follow that p j =0,j=1,..., k? For important classes of Banach algebras the answer turns out to be positive; in general, however, it is negative. A counterexample is given involving five nonzero bounded projections on infinite-dimensional separable Hilbert space. The number five is critical here: in Banach algebras nontrivial zero sums of four idempotents are impossible. In a purely algebraic context (no norm), the situation is different. There the critical number is four.
- Published
- 1994
- Full Text
- View/download PDF
38. The symmetric algebraic Riccati equation
- Author
-
Marinus A. Kaashoek, Harm Bart, and André C. M. Ran
- Subjects
Algebraic equation ,Pure mathematics ,Algebraic solution ,Riccati equation ,Algebraic function ,Linear-quadratic regulator ,Hermitian matrix ,Mathematics ,Algebraic differential equation ,Algebraic Riccati equation - Abstract
As we know from the previous part there is an intimate connection between canonical factorization and Riccati equations. In this chapter this connection is developed further for the case when the rational matrix functions involved have Hermitian values on the imaginary axis. In this case the corresponding Riccati equation has additional symmetry properties too.
- Published
- 2010
- Full Text
- View/download PDF
39. Explicit solutions using realizations
- Author
-
Marinus A. Kaashoek, Harm Bart, and André C. M. Ran
- Subjects
Unit circle ,Section (archaeology) ,Matrix function ,Applied mathematics ,State space ,Boundary value problem ,Singular integral ,Integral equation ,Toeplitz matrix ,Mathematics - Abstract
As we have seen in Chapter 1, canonical factorization serves as a tool to solve Wiener-Hopf integral equations, their discrete analogues, and the more general singular integral equations. In this chapter the state space factorization method developed in Chapter 2 is used to solve the problem of canonical factorization (necessary and sufficient conditions for its existence) and to derive explicit formulas for its factors. This is done in Section 3.1 for rational matrix functions and later in Section 7.1 for operator-valued transfer functions that are analytic on an open neighborhood of a curve. The results are applied to invert Wiener-Hopf integral equations with a rational matrix symbol (Section 3.2), block Toeplitz operators (Section 3.3) and singular integral equations (Section 3.4). The methods developed in this chapter also allow us to deal with the Riemann-Hilbert boundary value problem. This is done in the final section which also contains material on the homogeneous Wiener-Hopf equation.
- Published
- 2010
- Full Text
- View/download PDF
40. Pseudo-spectral factorizations of selfadjoint rational matrix functions
- Author
-
André C. M. Ran, Marinus A. Kaashoek, and Harm Bart
- Subjects
Pure mathematics ,Factorization ,Spectral theorem ,Positive-definite matrix ,Focus (optics) ,Rational matrices ,Mathematics - Abstract
In this chapter we consider rational matrix functions on a contour having values that are selfadjoint matrices, but not necessarily positive definite ones. Whereas in the previous chapter we studied spectral factorization, in the present chapter the focus will be on functions that have poles or zeros on the contour, and so we will consider pseudo-spectral factorization here.
- Published
- 2010
- Full Text
- View/download PDF
41. The state space method and factorization
- Author
-
Harm Bart, André C. M. Ran, and Marinus A. Kaashoek
- Subjects
Algebra ,Operator (computer programming) ,Factorization ,Section (archaeology) ,Computer science ,Factorization of polynomials ,State space ,Dixon's factorization method ,Incomplete LU factorization ,Realization (systems) - Abstract
This chapter describes in detail the elements of the state space method that are used throughout this book. The central notion is that of a realization of a matrix or operator function. The chapter consists of six sections. Section 2.1 presents preliminaries on realization, including the relevant definitions and the connection with systems theory. In the next two sections the realization problem is discussed. First for rational matrix functions in Section 2.2, and then for analytic operator functions in a possibly infinite dimensional setting in Section 2.3. The last three sections are devoted to the main operations on realizations that are needed in this book: inversion (Section 2.4), taking products (Section 2.5), and factorization (Section 2.6).
- Published
- 2010
- Full Text
- View/download PDF
42. The role of canonical factorization in solving convolution equations
- Author
-
Marinus A. Kaashoek, André C. M. Ran, and Harm Bart
- Subjects
Algebra ,Euler's factorization method ,Convolution theorem ,Singular integral ,Convolution power ,Integral equation ,Toeplitz matrix ,Toeplitz operator ,Mathematics ,Convolution - Abstract
This chapter has a preparatory character. We review (without giving proofs) the role of canonical factorization in inverting systems of convolution equations. The chapter consists of three sections. Section 1.1 deals with Wiener-Hopf integral equations, Section 1.2 with block Toeplitz equations, and Section 1.3 with singular integral equations.
- Published
- 2010
- Full Text
- View/download PDF
43. Review of the theory of matrices in indefinite inner product spaces
- Author
-
André C. M. Ran, Harm Bart, and Marinus A. Kaashoek
- Subjects
Algebra ,Inner product space ,Mathematical proof ,Mathematics - Abstract
In this chapter we present some background material on matrices in indefinite inner product spaces, and review the main results from this area that are used in this book. No proofs will be provided; we refer to the literature for more information. Good sources are [68] and [70]. The material is not only useful for understanding of the results of the preceding two chapters, but is also intended for use in subsequent chapters.
- Published
- 2010
- Full Text
- View/download PDF
44. Contractive rational matrix functions
- Author
-
Harm Bart, Marinus A. Kaashoek, and André C. M. Ran
- Subjects
Physics ,Pure mathematics ,media_common.quotation_subject ,Canonical factorization ,Value (computer science) ,Function (mathematics) ,Lambda ,Infinity ,Rational matrices ,Real line ,media_common - Abstract
In this chapter rational matrix functions are studied of which the values on the imaginary axis or on the real line are contractive matrices. Included are solutions to spectral or canonical factorization problems for functions V of the form $$ V(\lambda ) = I - W( - \bar \lambda )*W(\lambda ) or V(\lambda ) = I + W(\lambda ), $$ where W is a rational matrix function which has contractive values on the imaginary axis or on the real line and, in addition, has a strictly contractive value at infinity.
- Published
- 2010
- Full Text
- View/download PDF
45. Convolution equations and the transport equation
- Author
-
André C. M. Ran, Harm Bart, and Marinus A. Kaashoek
- Subjects
Pure mathematics ,symbols.namesake ,Partial differential equation ,Factorization ,Independent equation ,Differential equation ,Weierstrass factorization theorem ,Fundamental solution ,symbols ,Summation equation ,Integral equation ,Mathematics - Abstract
In this chapter the factorization theory developed in the previous chapters is applied to solve a linear transport equation. It is known that the transport equation may be transformed into a Wiener-Hopf integral equation with an operator-valued kernel function (see [40]). An equation of the latter type can be solved explicitly if a canonical factorization of its symbol is available (cf., Sections 1.1 and 3.2). In our case the symbol may be represented as a transfer function, and to make the factorization the general factorization theorem of the second chapter can be applied. This requires that one finds an appropriate pair of invariant subspaces. In the case of the transport equation the choice of the subspaces is evident, but to prove that their direct sum is the whole space takes some effort. The latter is related to a new difficulty that appears here. Namely, in this case the curve cuts through the spectra of the main operator and the associate main operator. Nevertheless, due to the special structure of the operators involved, the factorization can be made and explicit formulas are obtained.
- Published
- 2010
- Full Text
- View/download PDF
46. Canonical factorization and Riccati equations
- Author
-
Marinus A. Kaashoek, André C. M. Ran, and Harm Bart
- Subjects
Section (fiber bundle) ,Algebra ,Factorization ,Factorization of polynomials ,Euler's factorization method ,Riccati equation ,Linear subspace ,Mathematics ,Algebraic Riccati equation ,Connection (mathematics) - Abstract
In this chapter the canonical factorization theorem from Section 7.1 is presented in a different way using the notion of an angular subspace and Riccati equations. In this case one has to look for solutions of the Riccati equation that have additional spectral properties. Section 12.1, which has a preliminary character, deals with angular subspaces, and in particular those that are also spectral subspaces. Section 12.2 deals with the connection between factorization and Riccati equations in general, while Section 12.3 contains the main result. It specifies further the main theorem of the second section for the case of canonical factorization. In Section 12.4, as an application, we solve in state space form the problem of obtaining a right canonical factorization when a left one is given (or reversely).
- Published
- 2010
- Full Text
- View/download PDF
47. A State Space Approach to Canonical Factorization with Applications
- Author
-
Harm Bart, Marinus A. Kaashoek, and André C. M. Ran
- Published
- 2010
- Full Text
- View/download PDF
48. Wiener-Hopf factorization and factorization indices
- Author
-
Harm Bart, André C. M. Ran, and Marinus A. Kaashoek
- Subjects
Pure mathematics ,Operator (computer programming) ,Factorization ,Bounded function ,Euler's factorization method ,State (functional analysis) ,Incomplete Cholesky factorization ,Incomplete LU factorization ,Realization (systems) ,Mathematics - Abstract
This chapter concerns canonical as well as non-canonical Wiener-Hopf factorization of an operator-valued function which is analytic on a Cauchy contour. Such an operator function is given by a realization with a possibly infinite dimensional Banach space as state space, and with a bounded state operator and with bounded input-output operators. The first main result is a generalization to operator-valued functions of the canonical factorization theorem for rational matrix functions presented earlier in Section 3.1. In terms of the given realization, necessary and sufficient conditions are also presented in order that the operator function involved admits a (possibly non-canonical) Wiener-Hopf factorization. The corresponding factorization indices are described in terms of certain spectral invariants which are defined in terms of the realization but do only depend on the operator function and not on the particular choice of the realization. The analysis of these spectral invariants is one of the main themes of this chapter.
- Published
- 2010
- Full Text
- View/download PDF
49. Preliminaries concerning minimal factorization
- Author
-
André C. M. Ran, Harm Bart, and Marinus A. Kaashoek
- Subjects
Algebra ,Factorization ,Generalization ,Canonical factorization ,Gravitational singularity ,Mathematical proof ,Mathematics - Abstract
In this chapter we gather together several results concerning minimal realizations and minimal factorizations that will play an important role in the sequel. Most of these results can also be found in Part II of the book [20]. For the reader’s convenience we have chosen to summarize them here (without proofs). Special attention is given to the notion of pseudo-canonical factorization, which is a generalization of canonical factorization by allowing singularities on the curve.
- Published
- 2010
- Full Text
- View/download PDF
50. Factorization of non-proper rational matrix functions
- Author
-
André C. M. Ran, Harm Bart, and Marinus A. Kaashoek
- Subjects
Combinatorics ,Identity matrix ,Elliptic rational functions ,Rational function ,Nonnegative matrix ,Realization (systems) ,Square matrix ,Eigendecomposition of a matrix ,Matrix decomposition ,Mathematics - Abstract
In this chapter we treat the problem of factorizing a non-proper rational matrix function. The realization used in the earlier chapters is replaced by $$ V(\lambda ) = I + C(\lambda G - A)^{ - 1} B. $$ Here I=I m is the m × m identity matrix, A and G are square matrices of order n say, and the matrices C and B are of sizes m × n and n × m, respectively. Any rational m × m matrix function W, proper or non-proper, admits such a representation. The representation (4.1) allows us to extend the results obtained in the previous chapter to arbitrary rational matrix functions. As an application we treat the problem to invert a singular integral operator with a rational matrix symbol.
- Published
- 2010
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.