Inverse transformation matrix entry bounds

Click For Summary

Discussion Overview

The discussion revolves around determining the bounds for the inverse of an augmented matrix A that performs an affine transformation on sets of 2D vectors. The participants explore how the bounds of the transformation matrix, constrained by a parameter d, relate to the bounds of its inverse.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant states that matrix A can have values differing at most |d| from the identity matrix, leading to bounds of I_3 ± dI_3.
  • Another participant suggests creating an augmented matrix to find the inverse through row reduction, hoping to express the bounds of the inverse in terms of d.
  • There is a question about whether d is a scalar and if A must be a diagonal matrix, which is clarified to indicate that A is not diagonal but an identity matrix with values shifted by ±d.
  • A participant confirms that the expression I_3 ± dI_3 refers to adding or subtracting d to the diagonal elements of the identity matrix.
  • One participant corrects their earlier statement to clarify the use of repmat in MATLAB to express the bounds.

Areas of Agreement / Disagreement

Participants express uncertainty regarding the relationship between the bounds of the transformation matrix and its inverse. There is no consensus on how to derive the bounds for the inverse based on the given constraints.

Contextual Notes

Participants have not resolved the mathematical steps necessary to derive the bounds for the inverse transformation matrix, and there are dependencies on the definitions of the matrices involved.

atrus_ovis
Messages
99
Reaction score
0
I have sets of 2d vectors to be transformed by an augmented matrix A that performs an affine transform.
Matrix A can have values that differ at most |d| from the identity matrix, to limit the transformation, meaning that the min/max bounds for A are I_3 \pm dI_3

The problem is that i'd lke to have bounds for the inverse as well, expressed as a function of d, so that if i know that the transformation matrix is bound by d, that the matrix of the inverse transformation is bound by f(d).
I thought the same bounds would apply, but they don't.
Is there a way to find them?
 
Physics news on Phys.org
Nobody replies :(
Well i had the following idea:
make a matrix [ A , eye(3) , MinBound , MaxBound] , and reduce it to row echelon form.
That way the first 3x3 chunk will be eye(3) , the second the inverse of A , the third and fourth the respective min and max bounds for the inverse, hopefully.
 
atrus_ovis said:
Matrix A can have values that differ at most |d| from the identity matrix, to limit the transformation, meaning that the min/max bounds for A are I_3 \pm dI_3

Is d a scalar? Are you saying that A must be a diagonal matrix?
 
Hey atrus_ovis.

Try setting up the augmented system and find the inverse through row-reduction or by using co-factors (Cramers Rule) and you'll get an answer in terms of d.
 
Stephen Tashi said:
Is d a scalar? Are you saying that A must be a diagonal matrix?
It is a scalar.A is not a diagonal,it's an identity matrix, where each value is shifted by at least/most +/- d.

Try setting up the augmented system and find the inverse through row-reduction or by using co-factors (Cramers Rule) and you'll get an answer in terms of d.
Yup,that's what i did.
 
atrus_ovis said:
It is a scalar.A is not a diagonal,it's an identity matrix, where each value is shifted by at least/most +/- d.

The expression I_3 \pm d I_3 only adds or subtracts d to the diagonal elements of the identity matrix I_3.
 
You're right, i meant I_3 \pm \text{repmat(d,3,3)} in matlabese.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 12 ·
Replies
12
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 34 ·
2
Replies
34
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K