Estimate the number of iterations












0












$begingroup$


Construct $A =QLambda Q^T$. $Q$ is found by applying $QR$ factorization to $B=$randn($n$), and $Lambda$ is defined to be
begin{align*}
Lambda = mathrm{diag}(lambda_1,lambda_2,ldots,lambda_n),
end{align*}
where $(lambda_i)_{i=1}^n$ is a colloction of iid random variables and $lambda_1$ is uniform on $[-1,1]$. It's clear that $|A|<1$. Let $vec b=$rand($n,1$), which means its entries are uniformly distributed random variables on $[0,1]$.



When solving $(I - A)vec x = vec b$, I apply the Neumann series iteration as follows:
begin{align*}
vec x_0 &= vec 0,\
vec x_j &= Avec x_{j-1} + b, quad j = 1,2,3ldots.
end{align*}
There are two ways to define the number of iterations.



First, define the number of iterations $hat k_epsilon(A)$ as
begin{align*}
hat k_epsilon(A) = min left{ k : frac{|A|^k}{1 - |A|} sqrt{n}< epsilonright}.
end{align*}



Also, define the number of iterations $tilde k_epsilon(A,vec b, vec x_0)$ as
begin{align*}
tilde k_epsilon(A,vec b, vec x_0) &= min left{ k : |vec x - vec x_k| < epsilonright}.
end{align*}
When $vec b sim text{rand(n)}$, and $vec x_0 = 0$, I want to show that
begin{align*}
hat k_epsilon(A) geq tilde k_epsilon(A,vec b, vec x_0).
end{align*}
Besides, I want to find an expression for $hat k_epsilon(A)$ in terms of the eigenvalues of $A$? Since $hat k_epsilon(A)$ is affected only by $A$ and $epsilon$, can I just write $frac{|A|^k}{1 - |A|} sqrt{n}= epsilon$ and move everything except $k$ to the RHS and estimate the value of $k$? Is this the desired expression of $hat k_epsilon(A)$?






linear-algebra numerical-linear-algebra







share|cite|improve this question











$endgroup$












  • $begingroup$
    Any hint on how to solve this problem?
    $endgroup$
    – Jiexiong687691
    Nov 29 '18 at 9:08
















0












$begingroup$


Construct $A =QLambda Q^T$. $Q$ is found by applying $QR$ factorization to $B=$randn($n$), and $Lambda$ is defined to be
begin{align*}
Lambda = mathrm{diag}(lambda_1,lambda_2,ldots,lambda_n),
end{align*}
where $(lambda_i)_{i=1}^n$ is a colloction of iid random variables and $lambda_1$ is uniform on $[-1,1]$. It's clear that $|A|<1$. Let $vec b=$rand($n,1$), which means its entries are uniformly distributed random variables on $[0,1]$.



When solving $(I - A)vec x = vec b$, I apply the Neumann series iteration as follows:
begin{align*}
vec x_0 &= vec 0,\
vec x_j &= Avec x_{j-1} + b, quad j = 1,2,3ldots.
end{align*}
There are two ways to define the number of iterations.



First, define the number of iterations $hat k_epsilon(A)$ as
begin{align*}
hat k_epsilon(A) = min left{ k : frac{|A|^k}{1 - |A|} sqrt{n}< epsilonright}.
end{align*}



Also, define the number of iterations $tilde k_epsilon(A,vec b, vec x_0)$ as
begin{align*}
tilde k_epsilon(A,vec b, vec x_0) &= min left{ k : |vec x - vec x_k| < epsilonright}.
end{align*}
When $vec b sim text{rand(n)}$, and $vec x_0 = 0$, I want to show that
begin{align*}
hat k_epsilon(A) geq tilde k_epsilon(A,vec b, vec x_0).
end{align*}
Besides, I want to find an expression for $hat k_epsilon(A)$ in terms of the eigenvalues of $A$? Since $hat k_epsilon(A)$ is affected only by $A$ and $epsilon$, can I just write $frac{|A|^k}{1 - |A|} sqrt{n}= epsilon$ and move everything except $k$ to the RHS and estimate the value of $k$? Is this the desired expression of $hat k_epsilon(A)$?






linear-algebra numerical-linear-algebra







share|cite|improve this question











$endgroup$












  • $begingroup$
    Any hint on how to solve this problem?
    $endgroup$
    – Jiexiong687691
    Nov 29 '18 at 9:08














0












0








0





$begingroup$


Construct $A =QLambda Q^T$. $Q$ is found by applying $QR$ factorization to $B=$randn($n$), and $Lambda$ is defined to be
begin{align*}
Lambda = mathrm{diag}(lambda_1,lambda_2,ldots,lambda_n),
end{align*}
where $(lambda_i)_{i=1}^n$ is a colloction of iid random variables and $lambda_1$ is uniform on $[-1,1]$. It's clear that $|A|<1$. Let $vec b=$rand($n,1$), which means its entries are uniformly distributed random variables on $[0,1]$.



When solving $(I - A)vec x = vec b$, I apply the Neumann series iteration as follows:
begin{align*}
vec x_0 &= vec 0,\
vec x_j &= Avec x_{j-1} + b, quad j = 1,2,3ldots.
end{align*}
There are two ways to define the number of iterations.



First, define the number of iterations $hat k_epsilon(A)$ as
begin{align*}
hat k_epsilon(A) = min left{ k : frac{|A|^k}{1 - |A|} sqrt{n}< epsilonright}.
end{align*}



Also, define the number of iterations $tilde k_epsilon(A,vec b, vec x_0)$ as
begin{align*}
tilde k_epsilon(A,vec b, vec x_0) &= min left{ k : |vec x - vec x_k| < epsilonright}.
end{align*}
When $vec b sim text{rand(n)}$, and $vec x_0 = 0$, I want to show that
begin{align*}
hat k_epsilon(A) geq tilde k_epsilon(A,vec b, vec x_0).
end{align*}
Besides, I want to find an expression for $hat k_epsilon(A)$ in terms of the eigenvalues of $A$? Since $hat k_epsilon(A)$ is affected only by $A$ and $epsilon$, can I just write $frac{|A|^k}{1 - |A|} sqrt{n}= epsilon$ and move everything except $k$ to the RHS and estimate the value of $k$? Is this the desired expression of $hat k_epsilon(A)$?






linear-algebra numerical-linear-algebra







share|cite|improve this question











$endgroup$




Construct $A =QLambda Q^T$. $Q$ is found by applying $QR$ factorization to $B=$randn($n$), and $Lambda$ is defined to be
begin{align*}
Lambda = mathrm{diag}(lambda_1,lambda_2,ldots,lambda_n),
end{align*}
where $(lambda_i)_{i=1}^n$ is a colloction of iid random variables and $lambda_1$ is uniform on $[-1,1]$. It's clear that $|A|<1$. Let $vec b=$rand($n,1$), which means its entries are uniformly distributed random variables on $[0,1]$.



When solving $(I - A)vec x = vec b$, I apply the Neumann series iteration as follows:
begin{align*}
vec x_0 &= vec 0,\
vec x_j &= Avec x_{j-1} + b, quad j = 1,2,3ldots.
end{align*}
There are two ways to define the number of iterations.



First, define the number of iterations $hat k_epsilon(A)$ as
begin{align*}
hat k_epsilon(A) = min left{ k : frac{|A|^k}{1 - |A|} sqrt{n}< epsilonright}.
end{align*}



Also, define the number of iterations $tilde k_epsilon(A,vec b, vec x_0)$ as
begin{align*}
tilde k_epsilon(A,vec b, vec x_0) &= min left{ k : |vec x - vec x_k| < epsilonright}.
end{align*}
When $vec b sim text{rand(n)}$, and $vec x_0 = 0$, I want to show that
begin{align*}
hat k_epsilon(A) geq tilde k_epsilon(A,vec b, vec x_0).
end{align*}
Besides, I want to find an expression for $hat k_epsilon(A)$ in terms of the eigenvalues of $A$? Since $hat k_epsilon(A)$ is affected only by $A$ and $epsilon$, can I just write $frac{|A|^k}{1 - |A|} sqrt{n}= epsilon$ and move everything except $k$ to the RHS and estimate the value of $k$? Is this the desired expression of $hat k_epsilon(A)$?






linear-algebra numerical-linear-algebra




linear-algebra numerical-linear-algebra






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 3 '18 at 8:11







Jiexiong687691

















asked Nov 29 '18 at 8:09









Jiexiong687691Jiexiong687691

825




825












  • $begingroup$
    Any hint on how to solve this problem?
    $endgroup$
    – Jiexiong687691
    Nov 29 '18 at 9:08


















  • $begingroup$
    Any hint on how to solve this problem?
    $endgroup$
    – Jiexiong687691
    Nov 29 '18 at 9:08
















$begingroup$
Any hint on how to solve this problem?
$endgroup$
– Jiexiong687691
Nov 29 '18 at 9:08




$begingroup$
Any hint on how to solve this problem?
$endgroup$
– Jiexiong687691
Nov 29 '18 at 9:08










1 Answer
1






active

oldest

votes


















1












$begingroup$

Let $rho=sup_i(|lambda_i|)$. Then $||A||_2=rho$. If $rho<1$, then the sequence $(x_i)$ converges and you easily can calculate $k$.



Beware, if, for example $n$ is great and $rhoapprox 1-1/n$, then the convergence is very slow and the cost of the calculation of its limit becomes greater than the cost of the calculation of $(I-A)^{-1}$.



If you uniformly choose the $(lambda_i)$ in $[-1,1]$, then you will be very often in the above case!!






share|cite|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018343%2festimate-the-number-of-iterations%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    Let $rho=sup_i(|lambda_i|)$. Then $||A||_2=rho$. If $rho<1$, then the sequence $(x_i)$ converges and you easily can calculate $k$.



    Beware, if, for example $n$ is great and $rhoapprox 1-1/n$, then the convergence is very slow and the cost of the calculation of its limit becomes greater than the cost of the calculation of $(I-A)^{-1}$.



    If you uniformly choose the $(lambda_i)$ in $[-1,1]$, then you will be very often in the above case!!






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Let $rho=sup_i(|lambda_i|)$. Then $||A||_2=rho$. If $rho<1$, then the sequence $(x_i)$ converges and you easily can calculate $k$.



      Beware, if, for example $n$ is great and $rhoapprox 1-1/n$, then the convergence is very slow and the cost of the calculation of its limit becomes greater than the cost of the calculation of $(I-A)^{-1}$.



      If you uniformly choose the $(lambda_i)$ in $[-1,1]$, then you will be very often in the above case!!






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Let $rho=sup_i(|lambda_i|)$. Then $||A||_2=rho$. If $rho<1$, then the sequence $(x_i)$ converges and you easily can calculate $k$.



        Beware, if, for example $n$ is great and $rhoapprox 1-1/n$, then the convergence is very slow and the cost of the calculation of its limit becomes greater than the cost of the calculation of $(I-A)^{-1}$.



        If you uniformly choose the $(lambda_i)$ in $[-1,1]$, then you will be very often in the above case!!






        share|cite|improve this answer









        $endgroup$



        Let $rho=sup_i(|lambda_i|)$. Then $||A||_2=rho$. If $rho<1$, then the sequence $(x_i)$ converges and you easily can calculate $k$.



        Beware, if, for example $n$ is great and $rhoapprox 1-1/n$, then the convergence is very slow and the cost of the calculation of its limit becomes greater than the cost of the calculation of $(I-A)^{-1}$.



        If you uniformly choose the $(lambda_i)$ in $[-1,1]$, then you will be very often in the above case!!







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 30 '18 at 11:24









        loup blancloup blanc

        23.1k21850




        23.1k21850






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018343%2festimate-the-number-of-iterations%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

            Image
            2 2 I have a Zotero bibliography in Overleaf. I use biblatex . usepackage[backend=biber,citestyle=authoryear]{biblatex} addbibresource{zoteroALH.bib} Bibliography entries look like: @book{de_saint-gervais_uniformization_2016, title = {Uniformization of {Riemann} {Surfaces}}, isbn = {978-3-03719-145-3}, url = {https://www.ems-ph.org/books/book.php?proj_nr=198&srch=series%7Chem}, urldate = {2019-02-03}, author = {de Saint-Gervais, Paul Henri}, year = {2016}, doi = {10.4171/145} } In the bibliography down the paper the reference shows like this: There is the DOI, great, but also the URL which is unnecessary when the DOI is there. How can I remove the URL when the DOI is present? biblatex bibliographies overleaf zote
            Read more

            ComboBox Display Member on multiple fields

            Image
            2 I'm trying to set the .DisplayMember property of a ComboBox in C#, but I want to bind it to multiple columns in the .DataSouce . My SQL looks like this: SELECT PersNbr, PersFirstName, PersMiddleName, PersLastName FROM Pers WHERE PersNbr = :persNbr; I'm saving this query in a DataTable so each column selected has it's own column in the Datatable . I want to make the .DisplayMember a combination of PersFirstName + PersMiddleName + PersLastName so their full name appears like this: comboBox.DisplayMemeber = "PersFirstName" + "PersMiddleName" + "PersLastName" I know I can just to this on the query: SELECT PersNbr, (PersFirstName || PersMiddleName || PersLastName) PersName and then just do this: comboBox.DisplayMember = "PersName"; but I
            Read more

            Is it possible to collect Nectar points via Trainline?

            Image
            2 Since I am not eligible for any Railcard, the only available discount/bonus scheme is Nectar Card for me. GWR, SWR, LNER and Virgin Trains allow to collect Nectar points and I have already linked a card to my GWR account. A friend suggested me to use Trainline App, because it can search for bus tickets either. I had a look at the application, but could not see any option for Nectar. Is there a way to collect Nectar points when I buy tickets via Trainline? uk trains loyalty-programs trainline share | improve this question asked Dec 2 '18 at 15:50 ahmedus 3,224 5 19 49
            Read more