# Hermitian positive definite matrix and invertibility

Printable View

• April 22nd 2010, 04:15 PM
math8
Hermitian positive definite matrix and invertibility
Suppose A is a Hermitian positive definite matrix split into $A = C + C^{*} + D$ where $D$ is also Hermitian positive definite.
We show that $B=C+ \omega ^{-1} D$ is invertible. Consider the iteration $x_{n+1} = x_{n} + B^{-1} (b-Ax_{n})$ , with any initial iterate $x_{0}$ . Prove that $x_{n}$ converges to $x= A^{-1}b$ whenever $0< \omega < 2$.

I suppose to show invertibility, we need to show $det(B) \neq 0$. But I am not sure how to show that. Also for the convergence, do we show $lim_{n \rightarrow \infty } \left\| x_{n}-x \right\|= 0$ ? If yes, how?
• April 22nd 2010, 06:36 PM
Bruno J.
You want to show that $B$ is invertible, but $B^{-1}$ appears in the expression which you plan on using to do that... Are you sure you copied the problem properly?
• April 23rd 2010, 10:32 AM
math8
yes, the problem is copied properly. I think we need to first show that B is invertible (i.e. B inverse exists) to be able to use the expression for $x_{n+1}$ .
All times are GMT -8. The time now is 02:36 PM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 13, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9112724661827087, "perplexity_flag": "head"}