Statalist


[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: st:how to match created matrix to the original data set


From   Tirthankar Chakravarty <[email protected]>
To   [email protected]
Subject   Re: st:how to match created matrix to the original data set
Date   Tue, 18 Aug 2009 21:18:27 +0100

<>
I typically do not use anything other than the help files

help matrix functions

and an old Stata 8 Programming Reference Manual which has a very good
section on working with Stata matrices.

T

On Tue, Aug 18, 2009 at 9:01 PM, Mandy fu<[email protected]> wrote:
> Hi Tirthankar Chakravarty ,
>
> Thanks for your response! The way you suggested works well.
>
> By the way, may I know if you have any suggestion where I can find
> more discussion/instruction on matrix operations? Before I sent out my
> question, I have searched the manual and the online post. But did not
> find the answer(For example, I found "rowsof()"; but I have not yet
> seen using it after J). I think I must have missed some resource on
> matrix commands in Stata.
>
> Thanks again,
> Mandy
>
> On 8/18/09, Tirthankar Chakravarty <[email protected]> wrote:
>> <>
>>
>> The last part can be done this way:
>> ********************************
>> mat define A=(2,2,2,2,2,2,2,2,2 \/*
>>                */2,2,2,2,2,2,2,2,2 \/*
>>                */2,2,2,2,2,2,2,2,2)
>> mat list A
>> mat A = (A, J(rowsof(A), 1, 1))
>> mat list A
>> ********************************
>>
> *
> *   For searches and help try:
> *   http://www.stata.com/help.cgi?search
> *   http://www.stata.com/support/statalist/faq
> *   http://www.ats.ucla.edu/stat/stata/
>



-- 
To every ω-consistent recursive class κ of formulae there correspond
recursive class signs r, such that neither v Gen r nor Neg(v Gen r)
belongs to Flg(κ) (where v is the free variable of r).

*
*   For searches and help try:
*   http://www.stata.com/help.cgi?search
*   http://www.stata.com/support/statalist/faq
*   http://www.ats.ucla.edu/stat/stata/



© Copyright 1996–2024 StataCorp LLC   |   Terms of use   |   Privacy   |   Contact us   |   What's new   |   Site index