Reformulating a high-rank linear system into a block-matrix equationMatrix identity for symmetric block matrixDifferences between methods for solving linear equation systemLinear algebra question on rank and null spacesolve linear system using gaussian eliminationSolving a linear system with one more unknown than equationsDo two nonsingular matrices exist such that this linear system can be solved?Understanding solution of system of linear equationsSystem of linear simultaneous equationsRank of block triangular matrixModeling a linear system with unknown offset

I'm flying to France today and my passport expires in less than 2 months

A reference to a well-known characterization of scattered compact spaces

How to draw the figure with four pentagons?

What reasons are there for a Capitalist to oppose a 100% inheritance tax?

Is "remove commented out code" correct English?

Why are electrically insulating heatsinks so rare? Is it just cost?

In Romance of the Three Kingdoms why do people still use bamboo sticks when paper had already been invented?

CEO ridiculed me with gay jokes and grabbed me and wouldn't let go - now getting pushed out of company

Western buddy movie with a supernatural twist where a woman turns into an eagle at the end

Is there a hemisphere-neutral way of specifying a season?

Can one be a co-translator of a book, if he does not know the language that the book is translated into?

Why "Having chlorophyll without photosynthesis is actually very dangerous" and "like living with a bomb"?

Theorems that impeded progress

Assassin's bullet with mercury

Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?

Is it possible to create light that imparts a greater proportion of its energy as momentum rather than heat?

Fully-Firstable Anagram Sets

Arrow those variables!

Should I tell management that I intend to leave due to bad software development practices?

Took a trip to a parallel universe, need help deciphering

What's the difference between 'rename' and 'mv'?

Today is the Center

What is the intuition behind short exact sequences of groups; in particular, what is the intuition behind group extensions?

What mechanic is there to disable a threat instead of killing it?



Reformulating a high-rank linear system into a block-matrix equation


Matrix identity for symmetric block matrixDifferences between methods for solving linear equation systemLinear algebra question on rank and null spacesolve linear system using gaussian eliminationSolving a linear system with one more unknown than equationsDo two nonsingular matrices exist such that this linear system can be solved?Understanding solution of system of linear equationsSystem of linear simultaneous equationsRank of block triangular matrixModeling a linear system with unknown offset













0












$begingroup$


I have on my hands a linear system of equations of the following form
$$
sum_j=1^Ksum_q=1^N A_ijpq x_jq = b_ip quad(i=1dots K,p=1dots N)
$$

in which the $x_jq$ are unknown and the rest are given data.
I would like to recast this in the form $tilde Atilde x=tilde b$, where $tilde A$ is a $KN$-by-$KN$ matrix and $tilde x$ and $tilde b$ are each vectors of length $KN$. If I fix $K$ and $N$ to concrete values, I can work out by hand what $tilde A$, $tilde x$, and $tilde b$ should be. I am having trouble seeing the generalization for arbitrary $K$ and $N$. Surely there is one, though. What is it?










share|cite|improve this question











$endgroup$
















    0












    $begingroup$


    I have on my hands a linear system of equations of the following form
    $$
    sum_j=1^Ksum_q=1^N A_ijpq x_jq = b_ip quad(i=1dots K,p=1dots N)
    $$

    in which the $x_jq$ are unknown and the rest are given data.
    I would like to recast this in the form $tilde Atilde x=tilde b$, where $tilde A$ is a $KN$-by-$KN$ matrix and $tilde x$ and $tilde b$ are each vectors of length $KN$. If I fix $K$ and $N$ to concrete values, I can work out by hand what $tilde A$, $tilde x$, and $tilde b$ should be. I am having trouble seeing the generalization for arbitrary $K$ and $N$. Surely there is one, though. What is it?










    share|cite|improve this question











    $endgroup$














      0












      0








      0





      $begingroup$


      I have on my hands a linear system of equations of the following form
      $$
      sum_j=1^Ksum_q=1^N A_ijpq x_jq = b_ip quad(i=1dots K,p=1dots N)
      $$

      in which the $x_jq$ are unknown and the rest are given data.
      I would like to recast this in the form $tilde Atilde x=tilde b$, where $tilde A$ is a $KN$-by-$KN$ matrix and $tilde x$ and $tilde b$ are each vectors of length $KN$. If I fix $K$ and $N$ to concrete values, I can work out by hand what $tilde A$, $tilde x$, and $tilde b$ should be. I am having trouble seeing the generalization for arbitrary $K$ and $N$. Surely there is one, though. What is it?










      share|cite|improve this question











      $endgroup$




      I have on my hands a linear system of equations of the following form
      $$
      sum_j=1^Ksum_q=1^N A_ijpq x_jq = b_ip quad(i=1dots K,p=1dots N)
      $$

      in which the $x_jq$ are unknown and the rest are given data.
      I would like to recast this in the form $tilde Atilde x=tilde b$, where $tilde A$ is a $KN$-by-$KN$ matrix and $tilde x$ and $tilde b$ are each vectors of length $KN$. If I fix $K$ and $N$ to concrete values, I can work out by hand what $tilde A$, $tilde x$, and $tilde b$ should be. I am having trouble seeing the generalization for arbitrary $K$ and $N$. Surely there is one, though. What is it?







      linear-algebra matrices block-matrices






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 28 at 17:04









      Rodrigo de Azevedo

      13.1k41960




      13.1k41960










      asked Mar 21 at 15:05









      EndulumEndulum

      1566




      1566




















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          This turns out to be quite easy to do if one introduces new "super-indices" that run from $1dots KN$ according to some ordering convention (i.e., row- versus column-major). For instance, defining
          $$
          (ip) = i + K(p-1) \
          (jq) = j + K(q-1)
          $$

          allows the tensor equation in question to be recast from
          $$
          sum_j=1^Ksum_q=1^N A_ijpqx_jq = b_ip qquad (i=1dots K, p=1dots N)
          $$

          to the matrix equation
          $$
          sum_(jq)=1^KN tilde A_(ip),(jq) tilde x_(jq) = tilde b_(ip) qquad ((jq)=1..KN)
          $$

          with the correspondence $tilde A_(i,p),(j,q) = A_ijpq$, etc.






          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%2f3156934%2freformulating-a-high-rank-linear-system-into-a-block-matrix-equation%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









            0












            $begingroup$

            This turns out to be quite easy to do if one introduces new "super-indices" that run from $1dots KN$ according to some ordering convention (i.e., row- versus column-major). For instance, defining
            $$
            (ip) = i + K(p-1) \
            (jq) = j + K(q-1)
            $$

            allows the tensor equation in question to be recast from
            $$
            sum_j=1^Ksum_q=1^N A_ijpqx_jq = b_ip qquad (i=1dots K, p=1dots N)
            $$

            to the matrix equation
            $$
            sum_(jq)=1^KN tilde A_(ip),(jq) tilde x_(jq) = tilde b_(ip) qquad ((jq)=1..KN)
            $$

            with the correspondence $tilde A_(i,p),(j,q) = A_ijpq$, etc.






            share|cite|improve this answer









            $endgroup$

















              0












              $begingroup$

              This turns out to be quite easy to do if one introduces new "super-indices" that run from $1dots KN$ according to some ordering convention (i.e., row- versus column-major). For instance, defining
              $$
              (ip) = i + K(p-1) \
              (jq) = j + K(q-1)
              $$

              allows the tensor equation in question to be recast from
              $$
              sum_j=1^Ksum_q=1^N A_ijpqx_jq = b_ip qquad (i=1dots K, p=1dots N)
              $$

              to the matrix equation
              $$
              sum_(jq)=1^KN tilde A_(ip),(jq) tilde x_(jq) = tilde b_(ip) qquad ((jq)=1..KN)
              $$

              with the correspondence $tilde A_(i,p),(j,q) = A_ijpq$, etc.






              share|cite|improve this answer









              $endgroup$















                0












                0








                0





                $begingroup$

                This turns out to be quite easy to do if one introduces new "super-indices" that run from $1dots KN$ according to some ordering convention (i.e., row- versus column-major). For instance, defining
                $$
                (ip) = i + K(p-1) \
                (jq) = j + K(q-1)
                $$

                allows the tensor equation in question to be recast from
                $$
                sum_j=1^Ksum_q=1^N A_ijpqx_jq = b_ip qquad (i=1dots K, p=1dots N)
                $$

                to the matrix equation
                $$
                sum_(jq)=1^KN tilde A_(ip),(jq) tilde x_(jq) = tilde b_(ip) qquad ((jq)=1..KN)
                $$

                with the correspondence $tilde A_(i,p),(j,q) = A_ijpq$, etc.






                share|cite|improve this answer









                $endgroup$



                This turns out to be quite easy to do if one introduces new "super-indices" that run from $1dots KN$ according to some ordering convention (i.e., row- versus column-major). For instance, defining
                $$
                (ip) = i + K(p-1) \
                (jq) = j + K(q-1)
                $$

                allows the tensor equation in question to be recast from
                $$
                sum_j=1^Ksum_q=1^N A_ijpqx_jq = b_ip qquad (i=1dots K, p=1dots N)
                $$

                to the matrix equation
                $$
                sum_(jq)=1^KN tilde A_(ip),(jq) tilde x_(jq) = tilde b_(ip) qquad ((jq)=1..KN)
                $$

                with the correspondence $tilde A_(i,p),(j,q) = A_ijpq$, etc.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Mar 28 at 17:02









                EndulumEndulum

                1566




                1566



























                    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%2f3156934%2freformulating-a-high-rank-linear-system-into-a-block-matrix-equation%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

                    How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

                    random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

                    Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye