D_i

PCDBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PCDTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PCPBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PCPTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PDDBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PDDTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PDPBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PDPTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PSDBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PSDTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PSPBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PSPTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PZDBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PZDTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PZPBTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

PZPTTRF()

transfer last triangle D_i of local matrix to next processo
its main (odd) block a_i.

data

CLAMSH()

(size 2).
on exit, the data is rearranged in the best order fo

CLAREF()

if .true., then apply several reflectors at once and read
their data from the vecs array
t1, t2, and t3.

DLAMSH ()

(size 2).
on exit, the data is rearranged in the best order fo

DLAREF()

if .true., then apply several reflectors at once and read
their data from the vecs array
t1, t2, and t3.

PCDBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCDBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCDBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCDBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCDTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCDTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCDTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCDTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCGBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCGBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEBD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEBRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGECON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEHD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEHRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGELQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGELQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGELS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEQL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEQLF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEQPF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEQR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGEQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGERFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGERQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGERQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGESV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGESVD()

=====
each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGESVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGETF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGETRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGETRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGETRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGGQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCGGRQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHEEVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHEGS2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHEGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHEGVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHENGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHENTRD()

the tailored codes provide performance that is essentially
independent of the input data layout
the tailored codes place no restrictions on ia, ja, mb or nb.

PCHETD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHETRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCHETTRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding

PCLABRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLACGV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLACON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLACONSB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLACP2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLACP3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLACPY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAEVSWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAHQR()

*local* matrix is generated on one node (called smalla) and
work is done on that.  at the end of the border, the data i

PCLAMR1D()

pclamr1d redistributes a one-dimensional row vector from one data

PCLANGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAPIV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAPV2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAQGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAQSY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLARFB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLARFG()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLARFT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLARZB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLARZT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLASCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLASE2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLASET()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLASMSUB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLASSQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLASWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLATRA()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLATRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLATRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAUU2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAUUM()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCLAWIL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCMAX1()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCPBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCPOCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPOEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPORFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPOSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPOSVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPOTF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPOTRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPOTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPOTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCPTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCPTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PCSRSCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCSTEIN()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCTRCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCTREVC()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCTRRFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCTRTI2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCTRTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCTRTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCTZRZF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNG2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNG2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNGL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNGLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNGQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNGQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNGR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNGRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNM2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNM2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMBR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMHR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNML2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMR3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PCUNMTR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDDBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDDBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDDBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDDBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDDTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDDTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDDTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDDTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDGBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDGBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEBD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEBRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGECON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEHD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEHRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGELQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGELQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGELS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEQL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEQLF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEQPF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEQR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGEQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGERFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGERQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGERQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGESV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGESVD()

=====
each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGESVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGETF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGETRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGETRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGETRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGGQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDGGRQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLABRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLACON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLACONSB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLACP2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLACP3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLACPY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAEVSWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAHQR()

*local* matrix is generated on one node (called smalla) and
work is done on that.  at the end of the border, the data i

PDLAMR1D()

pdlamr1d redistributes a one-dimensional row vector from one data

PDLANGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAPIV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAPV2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAQGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAQSY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLARED1D()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLARED2D()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLARFB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLARFG()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLARFT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLARZB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLARZT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLASCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLASE2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLASET()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLASMSUB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLASSQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLASWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLATRA()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLATRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLATRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAUU2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAUUM()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDLAWIL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORG2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORG2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORGL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORGLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORGQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORGQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORGR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORGRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORM2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORM2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMBR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMHR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORML2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMR3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDORMTR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDPBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDPOCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPOEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPORFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPOSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPOSVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPOTF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPOTRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPOTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPOTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDPTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDPTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PDRSCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSTEIN()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYEVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYGS2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYGVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYNGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYNTRD()

the tailored codes provide performance that is essentially
independent of the input data layout
the tailored codes place no restrictions on ia, ja, mb or nb.

PDSYTD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYTRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDSYTTRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding

PDTRCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDTRRFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDTRTI2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDTRTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDTRTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDTZRZF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PDZSUM1()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PJLAENV()

pjlaenv.
= 1: the data layout blocksize
= 3: the algorithmic blocking factor;

PSCSUM1()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSDBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSDBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSDBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSDBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSDTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSDTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSDTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSDTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSGBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSGBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEBD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEBRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGECON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEHD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEHRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGELQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGELQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGELS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEQL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEQLF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEQPF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEQR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGEQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGERFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGERQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGERQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGESV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGESVD()

=====
each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGESVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGETF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGETRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGETRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGETRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGGQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSGGRQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLABRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLACON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLACONSB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLACP2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLACP3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLACPY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAEVSWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAHQR()

*local* matrix is generated on one node (called smalla) and
work is done on that.  at the end of the border, the data i

PSLAMR1D()

pslamr1d redistributes a one-dimensional row vector from one data

PSLANGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAPIV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAPV2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAQGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAQSY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLARED1D()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLARED2D()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLARFB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLARFG()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLARFT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLARZB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLARZT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLASCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLASE2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLASET()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLASMSUB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLASSQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLASWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLATRA()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLATRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLATRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAUU2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAUUM()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSLAWIL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORG2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORG2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORGL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORGLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORGQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORGQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORGR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORGRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORM2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORM2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMBR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMHR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORML2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMR3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSORMTR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSPBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSPOCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPOEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPORFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPOSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPOSVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPOTF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPOTRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPOTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPOTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSPTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSPTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PSRSCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSTEIN()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYEVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYGS2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYGVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYNGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYNTRD()

the tailored codes provide performance that is essentially
independent of the input data layout
the tailored codes place no restrictions on ia, ja, mb or nb.

PSSYTD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYTRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSSYTTRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding

PSTRCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSTRRFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSTRTI2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSTRTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSTRTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PSTZRZF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZDBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZDBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZDBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZDBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZDRSCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZDTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZDTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZDTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZDTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZGBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZGBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEBD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEBRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGECON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEHD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEHRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGELQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGELQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGELS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEQL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEQLF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEQPF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEQR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGEQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGERFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGERQ2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGERQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGESV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGESVD()

=====
each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGESVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGETF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGETRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGETRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGETRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGGQRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZGGRQF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHEEVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHEGS2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHEGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHEGVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHENGST()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHENTRD()

the tailored codes provide performance that is essentially
independent of the input data layout
the tailored codes place no restrictions on ia, ja, mb or nb.

PZHETD2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHETRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZHETTRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding

PZLABRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLACGV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLACON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLACONSB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLACP2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLACP3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLACPY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAEVSWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAHQR()

*local* matrix is generated on one node (called smalla) and
work is done on that.  at the end of the border, the data i

PZLAMR1D()

pzlamr1d redistributes a one-dimensional row vector from one data

PZLANGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAPIV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAPV2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAQGE()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAQSY()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLARFB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLARFG()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLARFT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLARZB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLARZT()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLASCL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLASE2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLASET()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLASMSUB()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLASSQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLASWP()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLATRA()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLATRD()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLATRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAUU2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAUUM()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZLAWIL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZMAX1()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPBSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPBTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZPBTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPBTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZPOCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPOEQU()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPORFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPOSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPOSVX()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPOTF2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPOTRF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPOTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPOTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPTSV()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPTTRF()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZPTTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZPTTRSV()

adjust addressing into matrix space to properly get into
the beginning part of the relevant data

PZSTEIN()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZTRCON()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZTREVC()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZTRRFS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZTRTI2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZTRTRI()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZTRTRS()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZTZRZF()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNG2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNG2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNGL2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNGLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNGQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNGQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNGR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNGRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNM2L()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNM2R()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMBR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMHR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNML2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMLQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMQL()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMQR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMR2()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMR3()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMRQ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMRZ()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

PZUNMTR()

each global data object is described by an associated descriptio
the mapping between an object element and its corresponding process

SLAMSH ()

(size 2).
on exit, the data is rearranged in the best order fo

SLAREF()

if .true., then apply several reflectors at once and read
their data from the vecs array
t1, t2, and t3.

ZLAMSH()

(size 2).
on exit, the data is rearranged in the best order fo

ZLAREF()

if .true., then apply several reflectors at once and read
their data from the vecs array
t1, t2, and t3.

date

PCHETTRD()

array ( nq x anb-1 ) for efficiency.  since only the lower
triangular portion of a is updated, av is computed as
two local triangular matrix-vector multiplications (both in

PDSYTTRD()

array ( nq x anb-1 ) for efficiency.  since only the lower
triangular portion of a is updated, av is computed as
two local triangular matrix-vector multiplications (both in

PSSYTTRD()

array ( nq x anb-1 ) for efficiency.  since only the lower
triangular portion of a is updated, av is computed as
two local triangular matrix-vector multiplications (both in

PZHETTRD()

array ( nq x anb-1 ) for efficiency.  since only the lower
triangular portion of a is updated, av is computed as
two local triangular matrix-vector multiplications (both in

dated

PCLACON()

the serial version clacon has been contributed by nick higham,
university of manchester. it was originally named sonest, dated

PDLACON()

the serial version dlacon has been contributed by nick higham,
university of manchester. it was originally named sonest, dated

PSLACON()

the serial version slacon has been contributed by nick higham,
university of manchester. it was originally named sonest, dated

PZLACON()

the serial version zlacon has been contributed by nick higham,
university of manchester. it was originally named sonest, dated

DBDSQR

PDGESVD()

wbdtosvd = size*(wantu*nru + wantvt*ncvt) +
max(wDBDSQR

DBLE

PCHEEVX()

anb = pjlaenv( ictxt, 3, 'pchettrd', 'l', 0, 0, 0, 0 )
sqnpc = sqrt( DBLE( nprow * npcol ) 

PCHEGVX()

anb = pjlaenv( ictxt, 3, 'pchettrd', 'l', 0, 0, 0, 0 )
sqnpc = sqrt( DBLE( nprow * npcol ) 

PDSYEVX()

0, 0, 0, 0)
sqnpc = int( sqrt( DBLE( nprow * npcol ) ) 

PDSYGVX()

0, 0, 0, 0)
sqnpc = int( sqrt( DBLE( nprow * npcol ) ) 
nb = desca( mb_ )

PDSYNTRD()

anb = pjlaenv( ictxt, 3, 'pdsyttrd', 'l', 0, 0, 0, 0 )
sqnpc = int( sqrt( DBLE( nprow * npcol ) ) 

PSSYEVX()

0, 0, 0, 0)
sqnpc = int( sqrt( DBLE( nprow * npcol ) ) 

PSSYGVX()

0, 0, 0, 0)
sqnpc = int( sqrt( DBLE( nprow * npcol ) ) 
nb = desca( mb_ )

PZHEEVX()

anb = pjlaenv( ictxt, 3, 'pzhettrd', 'l', 0, 0, 0, 0 )
sqnpc = sqrt( DBLE( nprow * npcol ) 

PZHEGVX()

anb = pjlaenv( ictxt, 3, 'pzhettrd', 'l', 0, 0, 0, 0 )
sqnpc = sqrt( DBLE( nprow * npcol ) 

PZHENTRD()

anb = pjlaenv( ictxt, 3, 'pzhettrd', 'l', 0, 0, 0, 0 )
sqnpc = int( sqrt( DBLE( nprow * npcol ) ) 

ZLAHQR2()

s = abs( DBLE( h( i,i-1 ) ) ) + abs( dble( h( i-1,i-2 ) ) 
prepare to use wilkinson's shift.

DBPTR

PCGBTRF()

DBPTR = pointer to diagonal blocks in 

PDGBTRF()

DBPTR = pointer to diagonal blocks in 

PSGBTRF()

DBPTR = pointer to diagonal blocks in 

PZGBTRF()

DBPTR = pointer to diagonal blocks in 

DCOL

PDLAED2()

DCOL   (global input) intege
matrix d is distributed. 0 <= dcol < npcol.

PDLAED3()

DCOL   (global input) intege
matrix d is distributed. 0 <= dcol < npcol.

PSLAED2()

DCOL   (global input) intege
matrix d is distributed. 0 <= dcol < npcol.

PSLAED3()

DCOL   (global input) intege
matrix d is distributed. 0 <= dcol < npcol.

Ddbtrf

DDBTF2()

Ddbtrf computes an lu factorization of a real m-by-n band matrix 

DDTTRF

DDTTRF()

DDTTRF computes an lu factorization of a complex tridiagonal matrix 

DDTTRSV()

with factors of the tridiagonal matrix a from the lu factorization
computed by DDTTRF
arguments

DDTTRSV

DDTTRSV()

DDTTRSV solves one of the systems of equation
u * x = b,  u**t * x = b,  or  u**h * x = b,

December

PCLACON()

a real or complex matrix, with applications to condition estimation",
acm trans. math. soft., vol. 14, no. 4, pp. 381-396, December 1988
=====================================================================

PDLACON()

a real or complex matrix, with applications to condition estimation",
acm trans. math. soft., vol. 14, no. 4, pp. 381-396, December 1988
=====================================================================

PSLACON()

a real or complex matrix, with applications to condition estimation",
acm trans. math. soft., vol. 14, no. 4, pp. 381-396, December 1988
=====================================================================

PZLACON()

a real or complex matrix, with applications to condition estimation",
acm trans. math. soft., vol. 14, no. 4, pp. 381-396, December 1988
=====================================================================

Decide

PCDTTRF()

Decide which processor offdiagonal block(s) goes t

PCLAQGE()

thresh is a threshold value used to Decide if row or column scalin
factors.  if rowcnd < thresh, row scaling is done, and if

PCLAQSY()

thresh is a threshold value used to Decide if scaling should be don
scaling is done.

PCPTTRF()

Decide which processor offdiagonal block(s) goes t

PDDTTRF()

Decide which processor offdiagonal block(s) goes t

PDLAQGE()

thresh is a threshold value used to Decide if row or column scalin
factors.  if rowcnd < thresh, row scaling is done, and if

PDLAQSY()

thresh is a threshold value used to Decide if scaling should be don
scaling is done.

PDPTTRF()

Decide which processor offdiagonal block(s) goes t

PSDTTRF()

Decide which processor offdiagonal block(s) goes t

PSLAQGE()

thresh is a threshold value used to Decide if row or column scalin
factors.  if rowcnd < thresh, row scaling is done, and if

PSLAQSY()

thresh is a threshold value used to Decide if scaling should be don
scaling is done.

PSPTTRF()

Decide which processor offdiagonal block(s) goes t

PZDTTRF()

Decide which processor offdiagonal block(s) goes t

PZLAQGE()

thresh is a threshold value used to Decide if row or column scalin
factors.  if rowcnd < thresh, row scaling is done, and if

PZLAQSY()

thresh is a threshold value used to Decide if scaling should be don
scaling is done.

PZPTTRF()

Decide which processor offdiagonal block(s) goes t

decides

PCSTEIN()

eigenvectors that are to be orthogonalized are computed by the same
process. pcstein decides on the allocation of work among th
individual process. if insufficient workspace is allocated, the

PDSTEIN()

eigenvectors that are to be orthogonalized are computed by the same
process. pdstein decides on the allocation of work among th
individual process. if insufficient workspace is allocated, the

PSSTEIN()

eigenvectors that are to be orthogonalized are computed by the same
process. psstein decides on the allocation of work among th
individual process. if insufficient workspace is allocated, the

PZSTEIN()

eigenvectors that are to be orthogonalized are computed by the same
process. pzstein decides on the allocation of work among th
individual process. if insufficient workspace is allocated, the

decimal

PDLAED3()

which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2.
it could conceivably fail on hexadecimal or decimal machine

PDSTEDC()

which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2.
it could conceivably fail on hexadecimal or decimal machine

PSLAED3()

which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2.
it could conceivably fail on hexadecimal or decimal machine

PSSTEDC()

which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2.
it could conceivably fail on hexadecimal or decimal machine

declared

CTRMVT()

ldt    - integer.
on entry, lda specifies the first dimension of a as declared
max( 1, n ).

DTRMVT()

ldt    - integer.
on entry, lda specifies the first dimension of a as declared
max( 1, n ).

STRMVT()

ldt    - integer.
on entry, lda specifies the first dimension of a as declared
max( 1, n ).

ZTRMVT()

ldt    - integer.
on entry, lda specifies the first dimension of a as declared
max( 1, n ).

decomposition

PCDBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PCDBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PCDTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PCDTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PCGBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PCGBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PCGESV()

the lu decomposition with partial pivoting and row interchanges i
tation matrix, l is unit lower triangular, and u is upper triangular.

PCGESVD()

pcgesvd computes the singular value decomposition (svd) of a
singular vectors. the svd is written as

PCGESVX()

2. if fact = 'n' or 'e', the lu decomposition is used to factor th
a = p * l * u,

PCGETF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PCGETRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PCGETRS()

this routine requires square block data decomposition ( mb_a=nb_a )
arguments

PCLAMR1D()

pclamr1d redistributes a one-dimensional row vector from one data
decomposition to another
this is an auxiliary routine called by pchetrd to redistribute d, e

PCPBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PCPBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PCPOSV()

the cholesky decomposition is used to factor sub( a ) a
sub( a ) = u**h * u,  if uplo = 'u', or

PCPOSVX()

2. if fact = 'n' or 'e', the cholesky decomposition is used t
a = u**t* u,  if uplo = 'u', or

PCPOTF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PCPOTRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PCPOTRS()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PCPTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PCPTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PDDBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PDDBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PDDTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PDDTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PDGBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PDGBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PDGESV()

the lu decomposition with partial pivoting and row interchanges i
tation matrix, l is unit lower triangular, and u is upper triangular.

PDGESVD()

pdgesvd computes the singular value decomposition (svd) of a
singular vectors. the svd is written as

PDGESVX()

2. if fact = 'n' or 'e', the lu decomposition is used to factor th
a = p * l * u,

PDGETF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PDGETRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PDGETRS()

this routine requires square block data decomposition ( mb_a=nb_a )
arguments

PDLAMR1D()

pdlamr1d redistributes a one-dimensional row vector from one data
decomposition to another
this is an auxiliary routine called by pdsytrd to redistribute d, e

PDPBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PDPBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PDPOSV()

the cholesky decomposition is used to factor sub( a ) a
sub( a ) = u**t * u,  if uplo = 'u', or

PDPOSVX()

2. if fact = 'n' or 'e', the cholesky decomposition is used t
a = u**t* u,  if uplo = 'u', or

PDPOTF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PDPOTRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PDPOTRS()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PDPTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PDPTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PJLAENV()

hence there is no need or opportunity to set the algorithmic or
data decomposition blocking factor
pxyytevx.f and pxyytgvx.f and pxyyttrd.f are the only codes which

PSDBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PSDBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PSDTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PSDTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PSGBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PSGBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PSGESV()

the lu decomposition with partial pivoting and row interchanges i
tation matrix, l is unit lower triangular, and u is upper triangular.

PSGESVD()

psgesvd computes the singular value decomposition (svd) of a
singular vectors. the svd is written as

PSGESVX()

2. if fact = 'n' or 'e', the lu decomposition is used to factor th
a = p * l * u,

PSGETF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PSGETRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PSGETRS()

this routine requires square block data decomposition ( mb_a=nb_a )
arguments

PSLAMR1D()

pslamr1d redistributes a one-dimensional row vector from one data
decomposition to another
this is an auxiliary routine called by pssytrd to redistribute d, e

PSPBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PSPBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PSPOSV()

the cholesky decomposition is used to factor sub( a ) a
sub( a ) = u**t * u,  if uplo = 'u', or

PSPOSVX()

2. if fact = 'n' or 'e', the cholesky decomposition is used t
a = u**t* u,  if uplo = 'u', or

PSPOTF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PSPOTRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PSPOTRS()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PSPTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PSPTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PZDBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PZDBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PZDTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PZDTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PZGBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PZGBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PZGESV()

the lu decomposition with partial pivoting and row interchanges i
tation matrix, l is unit lower triangular, and u is upper triangular.

PZGESVD()

pzgesvd computes the singular value decomposition (svd) of a
singular vectors. the svd is written as

PZGESVX()

2. if fact = 'n' or 'e', the lu decomposition is used to factor th
a = p * l * u,

PZGETF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PZGETRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PZGETRS()

this routine requires square block data decomposition ( mb_a=nb_a )
arguments

PZLAMR1D()

pzlamr1d redistributes a one-dimensional row vector from one data
decomposition to another
this is an auxiliary routine called by pzhetrd to redistribute d, e

PZPBSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PZPBTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithm description: divide and conquer

PZPOSV()

the cholesky decomposition is used to factor sub( a ) a
sub( a ) = u**h * u,  if uplo = 'u', or

PZPOSVX()

2. if fact = 'n' or 'e', the cholesky decomposition is used t
a = u**t* u,  if uplo = 'u', or

PZPOTF2()

this routine requires n <= nb_a-mod(ja-1, nb_a) and square block
decomposition ( mb_a = nb_a )
arguments

PZPOTRF()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PZPOTRS()

this routine requires square block decomposition ( mb_a = nb_a )
arguments

PZPTSV()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

PZPTTRS()

implemented. these go by many names, including divide and conquer,
partitioning, domain decomposition-type, etc
algorithms are the appropriate choice.

decrease

PDSYEVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PDSYGVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PSSYEVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PSSYGVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

decreased

PCHEEVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PCHEGVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PCSTEIN()

however, if the workspace is insufficient (see lwork), this
tolerance may be decreased until all eigenvectors to b
no orthogonalization will be done if orfac equals zero.

PDSTEIN()

however, if the workspace is insufficient (see lwork), this
tolerance may be decreased until all eigenvectors to b
no orthogonalization will be done if orfac equals zero.

PDSYEVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PDSYGVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PSSTEIN()

however, if the workspace is insufficient (see lwork), this
tolerance may be decreased until all eigenvectors to b
no orthogonalization will be done if orfac equals zero.

PSSYEVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PSSYGVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PZHEEVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PZHEGVX()

however, if the workspace is insufficient (see lwork),
tol may be decreased until all eigenvectors to b
no reorthogonalization will be done if orfac equals zero.

PZSTEIN()

however, if the workspace is insufficient (see lwork), this
tolerance may be decreased until all eigenvectors to b
no orthogonalization will be done if orfac equals zero.

decreases

CLAHQR2()

the main loop begins here. i is the loop index and decreases fro
with the active submatrix in rows and columns l to i.

PCLAHQR()

the main loop begins here. i is the loop index and decreases fro
iteration of the loop works  with the active submatrix in rows

PDLAHQR()

the main loop begins here. i is the loop index and decreases fro
iteration of the loop works  with the active submatrix in rows

PSLAHQR()

the main loop begins here. i is the loop index and decreases fro
iteration of the loop works  with the active submatrix in rows

PZLAHQR()

the main loop begins here. i is the loop index and decreases fro
iteration of the loop works  with the active submatrix in rows

ZLAHQR2()

the main loop begins here. i is the loop index and decreases fro
with the active submatrix in rows and columns l to i.

decreasing

DLAPST()

sort into decreasing orde

DLASRT2()

sort into decreasing orde

PCGESVD()

corresponding right and left singular vectors, respectively. the
singular values are returned in array s in decreasing order an
computed.

PDGESVD()

corresponding right and left singular vectors, respectively. the
singular values are returned in array s in decreasing order an
computed.

PDLASRT()

= 'i': sort d in increasing order;
= 'd': sort d in decreasing order. (not implemented yet
n       (global input) integer

PSGESVD()

corresponding right and left singular vectors, respectively. the
singular values are returned in array s in decreasing order an
computed.

PSLASRT()

= 'i': sort d in increasing order;
= 'd': sort d in decreasing order. (not implemented yet
n       (global input) integer

PZGESVD()

corresponding right and left singular vectors, respectively. the
singular values are returned in array s in decreasing order an
computed.

SLAPST()

sort into decreasing orde

SLASRT2()

sort into decreasing orde

default

PCHEEVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PCHEGVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PCSTEIN()

no orthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PDSTEBZ()

relfac  double precision, default = 2.
"relative tolerance" if  b-a < relfac*ulp*max(|a|,|b|),

PDSTEIN()

no orthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PDSYEVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PDSYGVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PSSTEBZ()

relfac  real, default = 2.
"relative tolerance" if  b-a < relfac*ulp*max(|a|,|b|),

PSSTEIN()

no orthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PSSYEVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PSSYGVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PZHEEVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PZHEGVX()

no reorthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

PZSTEIN()

no orthogonalization will be done if orfac equals zero.
a default value of 10^-3 is used if orfac is negative

Define

CDTTRF()

on exit, dl is overwritten by the (n-1) multipliers that
Define the matrix l from the lu factorization of a
d       (input/output) complex array, dimension (n)

CDTTRSV()

dl      (input) complex array, dimension (n-1)
the (n-1) multipliers that Define the matrix l from th

DDTTRF()

on exit, dl is overwritten by the (n-1) multipliers that
Define the matrix l from the lu factorization of a
d       (input/output) complex array, dimension (n)

DDTTRSV()

dl      (input) complex array, dimension (n-1)
the (n-1) multipliers that Define the matrix l from th

PCGBTRF()

Define the initial dimensions of the diagonal block

PCHEEV()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PCHEEVD()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PCHEEVX()

on entry, the hermitian matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PCHEGVX()

nhegst_lwopt )
where lwork is as Defined above, an
( nps + 1 ) * nps

PCLARFB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise

PCLARFT()

pclarft forms the triangular factor t of a complex block reflector h
of order n, which is Defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PCLARZB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise                        (not supported yet)

PCLARZT()

pclarzt forms the triangular factor t of a complex block reflector
h of order > n, which is Defined as a product of k elementar

PCUNMBR()

pcgebrd when reducing a complex distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are Define

PCUNMHR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

PCUNMTR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

PDGBTRF()

Define the initial dimensions of the diagonal block

PDLARFB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise

PDLARFT()

pdlarft forms the triangular factor t of a real block reflector h
of order n, which is Defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PDLARZB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise                        (not supported yet)

PDLARZT()

pdlarzt forms the triangular factor t of a real block reflector
h of order > n, which is Defined as a product of k elementar

PDORMBR()

pdgebrd when reducing a real distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are Define

PDORMHR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

PDORMTR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

PDSYEV()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PDSYEVD()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PDSYEVX()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PDSYGVX()

lwork   (local input) integer
see below for definitions of variables used to Define lwork
lwork >= 5 * n + max( 5 * nn, nb * ( np0 + 1 ) )

PSGBTRF()

Define the initial dimensions of the diagonal block

PSLARFB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise

PSLARFT()

pslarft forms the triangular factor t of a real block reflector h
of order n, which is Defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PSLARZB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise                        (not supported yet)

PSLARZT()

pslarzt forms the triangular factor t of a real block reflector
h of order > n, which is Defined as a product of k elementar

PSORMBR()

psgebrd when reducing a real distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are Define

PSORMHR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

PSORMTR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

PSSYEV()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PSSYEVD()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PSSYEVX()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PSSYGVX()

lwork   (local input) integer
see below for definitions of variables used to Define lwork
lwork >= 5 * n + max( 5 * nn, nb * ( np0 + 1 ) )

PZGBTRF()

Define the initial dimensions of the diagonal block

PZHEEV()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PZHEEVD()

on entry, the symmetric matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PZHEEVX()

on entry, the hermitian matrix a.  if uplo = 'u', only the
upper triangular part of a is used to Define the elements o
triangular part of a is used to define the elements of the

PZHEGVX()

nhegst_lwopt )
where lwork is as Defined above, an
( nps + 1 ) * nps

PZLARFB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise

PZLARFT()

pzlarft forms the triangular factor t of a complex block reflector h
of order n, which is Defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PZLARZB()

storev  (global input) character
indicates how the vectors which Define the elementar
= 'c': columnwise                        (not supported yet)

PZLARZT()

pzlarzt forms the triangular factor t of a complex block reflector
h of order > n, which is Defined as a product of k elementar

PZUNMBR()

pzgebrd when reducing a complex distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are Define

PZUNMHR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

PZUNMTR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is Defined as th

SDTTRF()

on exit, dl is overwritten by the (n-1) multipliers that
Define the matrix l from the lu factorization of a
d       (input/output) complex array, dimension (n)

SDTTRSV()

dl      (input) complex array, dimension (n-1)
the (n-1) multipliers that Define the matrix l from th

ZDTTRF()

on exit, dl is overwritten by the (n-1) multipliers that
Define the matrix l from the lu factorization of a
d       (input/output) complex array, dimension (n)

ZDTTRSV()

dl      (input) complex array, dimension (n-1)
the (n-1) multipliers that Define the matrix l from th

defined

PCHEEVX()

lwork >= max( lwork, nhetrd_lwork )
where lwork is as defined above, an
( nps + 1 ) * nps

PCHEGVX()

nhegst_lwopt )
where lwork is as defined above, an
( nps + 1 ) * nps

PCLARFT()

pclarft forms the triangular factor t of a complex block reflector h
of order n, which is defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PCLARZT()

pclarzt forms the triangular factor t of a complex block reflector
h of order > n, which is defined as a product of k elementar

PCTREVC()

the right eigenvector x and the left eigenvector y of t corresponding
to an eigenvalue w are defined by
t*x = w*x,     y'*t = w*y'

PCUNG2L()

pcung2l generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PCUNG2R()

pcung2r generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PCUNGL2()

pcungl2 generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PCUNGLQ()

pcunglq generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PCUNGQL()

pcungql generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PCUNGQR()

pcungqr generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PCUNGR2()

pcungr2 generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PCUNGRQ()

pcungrq generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PCUNM2L()

where q is a complex unitary distributed matrix defined as th

PCUNM2R()

where q is a complex unitary distributed matrix defined as th

PCUNMBR()

pcgebrd when reducing a complex distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined

PCUNMHR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

PCUNML2()

where q is a complex unitary distributed matrix defined as th

PCUNMLQ()

where q is a complex unitary distributed matrix defined as th

PCUNMQL()

where q is a complex unitary distributed matrix defined as th

PCUNMQR()

where q is a complex unitary distributed matrix defined as th

PCUNMR2()

where q is a complex unitary distributed matrix defined as th

PCUNMR3()

where q is a complex unitary distributed matrix defined as th

PCUNMRQ()

where q is a complex unitary distributed matrix defined as th

PCUNMRZ()

where q is a complex unitary distributed matrix defined as th

PCUNMTR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

PDLAED3()

pdlaed3 finds the roots of the secular equation, as defined by th
appropriate calls to slaed4

PDLARFT()

pdlarft forms the triangular factor t of a real block reflector h
of order n, which is defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PDLARZT()

pdlarzt forms the triangular factor t of a real block reflector
h of order > n, which is defined as a product of k elementar

PDORG2L()

pdorg2l generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PDORG2R()

pdorg2r generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PDORGL2()

pdorgl2 generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PDORGLQ()

pdorglq generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PDORGQL()

pdorgql generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PDORGQR()

pdorgqr generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PDORGR2()

pdorgr2 generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PDORGRQ()

pdorgrq generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PDORM2L()

where q is a real orthogonal distributed matrix defined as th

PDORM2R()

where q is a real orthogonal distributed matrix defined as th

PDORMBR()

pdgebrd when reducing a real distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined

PDORMHR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

PDORML2()

where q is a real orthogonal distributed matrix defined as th

PDORMLQ()

where q is a real orthogonal distributed matrix defined as th

PDORMQL()

where q is a real orthogonal distributed matrix defined as th

PDORMQR()

where q is a real orthogonal distributed matrix defined as th

PDORMR2()

where q is a real orthogonal distributed matrix defined as th

PDORMR3()

where q is a real orthogonal distributed matrix defined as th

PDORMRQ()

where q is a real orthogonal distributed matrix defined as th

PDORMRZ()

where q is a real orthogonal distributed matrix defined as th

PDORMTR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

PDSYEV()

with myprowc defined when a new context is created as
call blacs_gridinit( contextc, 'r', nprocs, 1 )

PDSYEVX()

where clustersize is the number of eigenvalues in the
largest cluster, where a cluster is defined as a set o
w(j+1) <= w(j) + orfac*2*norm(a) }

PDSYGVX()

where clustersize is the number of eigenvalues in the
largest cluster, where a cluster is defined as a set o
w(j+1) <= w(j) + orfac*2*norm(a) }

PSLAED3()

pslaed3 finds the roots of the secular equation, as defined by th
appropriate calls to slaed4

PSLARFT()

pslarft forms the triangular factor t of a real block reflector h
of order n, which is defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PSLARZT()

pslarzt forms the triangular factor t of a real block reflector
h of order > n, which is defined as a product of k elementar

PSORG2L()

psorg2l generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PSORG2R()

psorg2r generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PSORGL2()

psorgl2 generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PSORGLQ()

psorglq generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PSORGQL()

psorgql generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PSORGQR()

psorgqr generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PSORGR2()

psorgr2 generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PSORGRQ()

psorgrq generates an m-by-n real distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PSORM2L()

where q is a real orthogonal distributed matrix defined as th

PSORM2R()

where q is a real orthogonal distributed matrix defined as th

PSORMBR()

psgebrd when reducing a real distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined

PSORMHR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

PSORML2()

where q is a real orthogonal distributed matrix defined as th

PSORMLQ()

where q is a real orthogonal distributed matrix defined as th

PSORMQL()

where q is a real orthogonal distributed matrix defined as th

PSORMQR()

where q is a real orthogonal distributed matrix defined as th

PSORMR2()

where q is a real orthogonal distributed matrix defined as th

PSORMR3()

where q is a real orthogonal distributed matrix defined as th

PSORMRQ()

where q is a real orthogonal distributed matrix defined as th

PSORMRZ()

where q is a real orthogonal distributed matrix defined as th

PSORMTR()

where q is a real orthogonal distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

PSSYEV()

with myprowc defined when a new context is created as
call blacs_gridinit( contextc, 'r', nprocs, 1 )

PSSYEVX()

where clustersize is the number of eigenvalues in the
largest cluster, where a cluster is defined as a set o
w(j+1) <= w(j) + orfac*2*norm(a) }

PSSYGVX()

where clustersize is the number of eigenvalues in the
largest cluster, where a cluster is defined as a set o
w(j+1) <= w(j) + orfac*2*norm(a) }

PZHEEVX()

lwork >= max( lwork, nhetrd_lwork )
where lwork is as defined above, an
( nps + 1 ) * nps

PZHEGVX()

nhegst_lwopt )
where lwork is as defined above, an
( nps + 1 ) * nps

PZLARFT()

pzlarft forms the triangular factor t of a complex block reflector h
of order n, which is defined as a product of k elementary reflectors
if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular;

PZLARZT()

pzlarzt forms the triangular factor t of a complex block reflector
h of order > n, which is defined as a product of k elementar

PZTREVC()

the right eigenvector x and the left eigenvector y of t corresponding
to an eigenvalue w are defined by
t*x = w*x,     y'*t = w*y'

PZUNG2L()

pzung2l generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PZUNG2R()

pzung2r generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PZUNGL2()

pzungl2 generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PZUNGLQ()

pzunglq generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a

PZUNGQL()

pzungql generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a

PZUNGQR()

pzungqr generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined a
m

PZUNGR2()

pzungr2 generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PZUNGRQ()

pzungrq generates an m-by-n complex distributed matrix q denoting
a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th

PZUNM2L()

where q is a complex unitary distributed matrix defined as th

PZUNM2R()

where q is a complex unitary distributed matrix defined as th

PZUNMBR()

pzgebrd when reducing a complex distributed matrix a(ia:*,ja:*) to
bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined

PZUNMHR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

PZUNML2()

where q is a complex unitary distributed matrix defined as th

PZUNMLQ()

where q is a complex unitary distributed matrix defined as th

PZUNMQL()

where q is a complex unitary distributed matrix defined as th

PZUNMQR()

where q is a complex unitary distributed matrix defined as th

PZUNMR2()

where q is a complex unitary distributed matrix defined as th

PZUNMR3()

where q is a complex unitary distributed matrix defined as th

PZUNMRQ()

where q is a complex unitary distributed matrix defined as th

PZUNMRZ()

where q is a complex unitary distributed matrix defined as th

PZUNMTR()

where q is a complex unitary distributed matrix of order nq, with
nq = m if side = 'l' and nq = n if side = 'r'. q is defined as th

defines

PCLARFB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
v       (local input) complex pointer into the local memory

PCLARFT()

if storev = 'c', the vector which defines the elementary reflecto

PCLARZB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
l       (global input) integer

PCLARZT()

if storev = 'c', the vector which defines the elementary reflecto

PCUNG2L()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNG2R()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNGL2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNGLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNGQL()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNGQR()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNGR2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNGRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PCUNM2L()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNM2R()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNML2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNMLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNMQL()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNMQR()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNMR2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNMR3()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNMRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PCUNMRZ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDLARFB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
v       (local input) double precision pointer into the local memory

PDLARFT()

if storev = 'c', the vector which defines the elementary reflecto

PDLARZB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
l       (global input) integer

PDLARZT()

if storev = 'c', the vector which defines the elementary reflecto

PDORG2L()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORG2R()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORGL2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORGLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORGQL()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORGQR()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORGR2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORGRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PDORM2L()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORM2R()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORML2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORMLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORMQL()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORMQR()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORMR2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORMR3()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORMRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PDORMRZ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSLARFB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
v       (local input) real pointer into the local memory

PSLARFT()

if storev = 'c', the vector which defines the elementary reflecto

PSLARZB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
l       (global input) integer

PSLARZT()

if storev = 'c', the vector which defines the elementary reflecto

PSORG2L()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORG2R()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORGL2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORGLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORGQL()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORGQR()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORGR2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORGRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PSORM2L()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORM2R()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORML2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORMLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORMQL()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORMQR()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORMR2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORMR3()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORMRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PSORMRZ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZLARFB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
v       (local input) complex*16 pointer into the local memory

PZLARFT()

if storev = 'c', the vector which defines the elementary reflecto

PZLARZB()

the order of the matrix t (= the number of elementary
reflectors whose product defines the block reflector)
l       (global input) integer

PZLARZT()

if storev = 'c', the vector which defines the elementary reflecto

PZUNG2L()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNG2R()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNGL2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNGLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNGQL()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNGQR()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNGR2()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNGRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th

PZUNM2L()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNM2R()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNML2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNMLQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNMQL()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNMQR()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNMR2()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNMR3()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNMRQ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

PZUNMRZ()

k       (global input) integer
the number of elementary reflectors whose product defines th
n >= k >= 0.

defining

PCGEBD2()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PCGEBRD()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PCGEHD2()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PCGEHRD()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PCHENTRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PCHETD2()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PCHETRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PCHETTRD()

where d and e denote diagonal and off-diagonal elements of t, and
vi denotes an element of the vector defining h(i)
data storage requirements

PCLABRD()

where a denotes an element of the original matrix which is unchanged,
vi denotes an element of the vector defining h(i), and ui an elemen

PCLAHRD()

hessenberg matrix h, and vi denotes an element of the vector
defining h(i)
=====================================================================

PCLATRD()

an element of the original matrix that is unchanged, and vi denotes
an element of the vector defining h(i)
=====================================================================

PDGEBD2()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PDGEBRD()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PDGEHD2()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PDGEHRD()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PDLABRD()

where a denotes an element of the original matrix which is unchanged,
vi denotes an element of the vector defining h(i), and ui an elemen

PDLAHRD()

hessenberg matrix h, and vi denotes an element of the vector
defining h(i)
=====================================================================

PDLATRD()

an element of the original matrix that is unchanged, and vi denotes
an element of the vector defining h(i)
=====================================================================

PDSYNTRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PDSYTD2()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PDSYTRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PDSYTTRD()

where d and e denote diagonal and off-diagonal elements of t, and
vi denotes an element of the vector defining h(i)
data storage requirements

PSGEBD2()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PSGEBRD()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PSGEHD2()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PSGEHRD()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PSLABRD()

where a denotes an element of the original matrix which is unchanged,
vi denotes an element of the vector defining h(i), and ui an elemen

PSLAHRD()

hessenberg matrix h, and vi denotes an element of the vector
defining h(i)
=====================================================================

PSLATRD()

an element of the original matrix that is unchanged, and vi denotes
an element of the vector defining h(i)
=====================================================================

PSSYNTRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PSSYTD2()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PSSYTRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PSSYTTRD()

where d and e denote diagonal and off-diagonal elements of t, and
vi denotes an element of the vector defining h(i)
data storage requirements

PZGEBD2()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PZGEBRD()

where d and e denote diagonal and off-diagonal elements of b, vi
denotes an element of the vector defining h(i), and ui an element o

PZGEHD2()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PZGEHRD()

a modified element of the upper hessenberg matrix h, and vi denotes
an element of the vector defining h(ja+ilo+i-2)
alignment requirements

PZHENTRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PZHETD2()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PZHETRD()

where d and e denote diagonal and off-diagonal elements of t, and vi
denotes an element of the vector defining h(i)
alignment requirements

PZHETTRD()

where d and e denote diagonal and off-diagonal elements of t, and
vi denotes an element of the vector defining h(i)
data storage requirements

PZLABRD()

where a denotes an element of the original matrix which is unchanged,
vi denotes an element of the vector defining h(i), and ui an elemen

PZLAHRD()

hessenberg matrix h, and vi denotes an element of the vector
defining h(i)
=====================================================================

PZLATRD()

an element of the original matrix that is unchanged, and vi denotes
an element of the vector defining h(i)
=====================================================================

definite

CPTTRSV()

where l or u is the cholesky factor of a hermitian positive
definite tridiagonal matrix a such tha

DPTTRSV()

where l is the cholesky factor of a hermitian positive
definite tridiagonal matrix a such tha

PCHEGS2()

pchegs2 reduces a complex hermitian-definite generalized eigenproble

PCHEGST()

pchegst reduces a complex hermitian-definite generalized eigenproble

PCHEGVX()

the eigenvectors
of a complex generalized hermitian-definite eigenproblem, of the for
sub( b )*sub( a )*x=(lambda)*x.

PCHENGST()

pchengst reduces a complex hermitian-definite generalize

PCPBSV()

where a(1:n, ja:ja+n-1) is an n-by-n complex
banded symmetric positive definite distribute

PCPBTRS()

a(1:n, ja:ja+n-1) is an n-by-n complex
banded symmetric positive definite distribute
depending on the value of uplo, a stores either u or l in the equn

PCPOCON()

pcpocon estimates the reciprocal of the condition number (in the
1-norm) of a complex hermitian positive definite distributed matri
pcpotrf.

PCPOEQU()

pcpoequ computes row and column scalings intended to
equilibrate a distributed hermitian positive definite matri
(with respect to the two-norm).  sr and sc contain the scale

PCPORFS()

pcporfs improves the computed solution to a system of linear
equations when the coefficient matrix is hermitian positive definite
solutions.

PCPOSV()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is an n-by-n
hermitian distributed positive definite matrix and x and sub( b 
matrices.

PCPOSVX()

<= n: if info = i, the leading minor of order i of a
is not positive definite, so the factorizatio
bounds could not be computed.

PCPOTF2()

pcpotf2 computes the cholesky factorization of a complex hermitian
positive definite distributed matrix sub( a )=a(ia:ia+n-1,ja:ja+n-1)
the factorization has the form

PCPOTRF()

pcpotrf computes the cholesky factorization of an n-by-n complex
hermitian positive definite distributed matrix sub( a ) denotin

PCPOTRI()

pcpotri computes the inverse of a complex hermitian positive definite
cholesky factorization sub( a ) = u**h*u or l*l**h computed by

PCPOTRS()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is a n-by-n
hermitian positive definite distributed matrix using the cholesk
sub( b ) denotes the distributed matrix b(ib:ib+n-1,jb:jb+nrhs-1).

PCPTSV()

where a(1:n, ja:ja+n-1) is an n-by-n complex
tridiagonal symmetric positive definite distribute

PCPTTRS()

a(1:n, ja:ja+n-1) is an n-by-n complex
tridiagonal symmetric positive definite distribute
depending on the value of uplo, a stores either u or l in the equn

PDPBSV()

where a(1:n, ja:ja+n-1) is an n-by-n real
banded symmetric positive definite distribute

PDPBTRS()

a(1:n, ja:ja+n-1) is an n-by-n real
banded symmetric positive definite distribute
depending on the value of uplo, a stores either u or l in the equn

PDPOCON()

pdpocon estimates the reciprocal of the condition number (in the
1-norm) of a real symmetric positive definite distributed matri
pdpotrf.

PDPOEQU()

pdpoequ computes row and column scalings intended to
equilibrate a distributed symmetric positive definite matri
(with respect to the two-norm).  sr and sc contain the scale

PDPORFS()

pdporfs improves the computed solution to a system of linear
equations when the coefficient matrix is symmetric positive definite
solutions.

PDPOSV()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is an n-by-n
symmetric distributed positive definite matrix and x and sub( b 
matrices.

PDPOSVX()

<= n: if info = i, the leading minor of order i of a
is not positive definite, so the factorizatio
bounds could not be computed.

PDPOTF2()

pdpotf2 computes the cholesky factorization of a real symmetric
positive definite distributed matrix sub( a )=a(ia:ia+n-1,ja:ja+n-1)
the factorization has the form

PDPOTRF()

pdpotrf computes the cholesky factorization of an n-by-n real
symmetric positive definite distributed matrix sub( a ) denotin

PDPOTRI()

pdpotri computes the inverse of a real symmetric positive definite
cholesky factorization sub( a ) = u**t*u or l*l**t computed by

PDPOTRS()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is a n-by-n
symmetric positive definite distributed matrix using the cholesk
sub( b ) denotes the distributed matrix b(ib:ib+n-1,jb:jb+nrhs-1).

PDPTSV()

where a(1:n, ja:ja+n-1) is an n-by-n real
tridiagonal symmetric positive definite distribute

PDPTTRS()

a(1:n, ja:ja+n-1) is an n-by-n real
tridiagonal symmetric positive definite distribute

PDSYGS2()

pdsygs2 reduces a real symmetric-definite generalized eigenproble

PDSYGST()

pdsygst reduces a real symmetric-definite generalized eigenproble

PDSYGVX()

the eigenvectors
of a real generalized sy-definite eigenproblem, of the for
sub( b )*sub( a )*x=(lambda)*x.

PDSYNGST()

pdsyngst reduces a complex hermitian-definite generalize

PSPBSV()

where a(1:n, ja:ja+n-1) is an n-by-n real
banded symmetric positive definite distribute

PSPBTRS()

a(1:n, ja:ja+n-1) is an n-by-n real
banded symmetric positive definite distribute
depending on the value of uplo, a stores either u or l in the equn

PSPOCON()

pspocon estimates the reciprocal of the condition number (in the
1-norm) of a real symmetric positive definite distributed matri
pspotrf.

PSPOEQU()

pspoequ computes row and column scalings intended to
equilibrate a distributed symmetric positive definite matri
(with respect to the two-norm).  sr and sc contain the scale

PSPORFS()

psporfs improves the computed solution to a system of linear
equations when the coefficient matrix is symmetric positive definite
solutions.

PSPOSV()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is an n-by-n
symmetric distributed positive definite matrix and x and sub( b 
matrices.

PSPOSVX()

<= n: if info = i, the leading minor of order i of a
is not positive definite, so the factorizatio
bounds could not be computed.

PSPOTF2()

pspotf2 computes the cholesky factorization of a real symmetric
positive definite distributed matrix sub( a )=a(ia:ia+n-1,ja:ja+n-1)
the factorization has the form

PSPOTRF()

pspotrf computes the cholesky factorization of an n-by-n real
symmetric positive definite distributed matrix sub( a ) denotin

PSPOTRI()

pspotri computes the inverse of a real symmetric positive definite
cholesky factorization sub( a ) = u**t*u or l*l**t computed by

PSPOTRS()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is a n-by-n
symmetric positive definite distributed matrix using the cholesk
sub( b ) denotes the distributed matrix b(ib:ib+n-1,jb:jb+nrhs-1).

PSPTSV()

where a(1:n, ja:ja+n-1) is an n-by-n real
tridiagonal symmetric positive definite distribute

PSPTTRS()

a(1:n, ja:ja+n-1) is an n-by-n real
tridiagonal symmetric positive definite distribute

PSSYGS2()

pssygs2 reduces a real symmetric-definite generalized eigenproble

PSSYGST()

pssygst reduces a real symmetric-definite generalized eigenproble

PSSYGVX()

the eigenvectors
of a real generalized sy-definite eigenproblem, of the for
sub( b )*sub( a )*x=(lambda)*x.

PSSYNGST()

pssyngst reduces a complex hermitian-definite generalize

PZHEGS2()

pzhegs2 reduces a complex hermitian-definite generalized eigenproble

PZHEGST()

pzhegst reduces a complex hermitian-definite generalized eigenproble

PZHEGVX()

the eigenvectors
of a complex generalized hermitian-definite eigenproblem, of the for
sub( b )*sub( a )*x=(lambda)*x.

PZHENGST()

pzhengst reduces a complex hermitian-definite generalize

PZPBSV()

where a(1:n, ja:ja+n-1) is an n-by-n complex
banded symmetric positive definite distribute

PZPBTRS()

a(1:n, ja:ja+n-1) is an n-by-n complex
banded symmetric positive definite distribute
depending on the value of uplo, a stores either u or l in the equn

PZPOCON()

pzpocon estimates the reciprocal of the condition number (in the
1-norm) of a complex hermitian positive definite distributed matri
pzpotrf.

PZPOEQU()

pzpoequ computes row and column scalings intended to
equilibrate a distributed hermitian positive definite matri
(with respect to the two-norm).  sr and sc contain the scale

PZPORFS()

pzporfs improves the computed solution to a system of linear
equations when the coefficient matrix is hermitian positive definite
solutions.

PZPOSV()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is an n-by-n
hermitian distributed positive definite matrix and x and sub( b 
matrices.

PZPOSVX()

<= n: if info = i, the leading minor of order i of a
is not positive definite, so the factorizatio
bounds could not be computed.

PZPOTF2()

pzpotf2 computes the cholesky factorization of a complex hermitian
positive definite distributed matrix sub( a )=a(ia:ia+n-1,ja:ja+n-1)
the factorization has the form

PZPOTRF()

pzpotrf computes the cholesky factorization of an n-by-n complex
hermitian positive definite distributed matrix sub( a ) denotin

PZPOTRI()

pzpotri computes the inverse of a complex hermitian positive definite
cholesky factorization sub( a ) = u**h*u or l*l**h computed by

PZPOTRS()

where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is a n-by-n
hermitian positive definite distributed matrix using the cholesk
sub( b ) denotes the distributed matrix b(ib:ib+n-1,jb:jb+nrhs-1).

PZPTSV()

where a(1:n, ja:ja+n-1) is an n-by-n complex
tridiagonal symmetric positive definite distribute

PZPTTRS()

a(1:n, ja:ja+n-1) is an n-by-n complex
tridiagonal symmetric positive definite distribute
depending on the value of uplo, a stores either u or l in the equn

SPTTRSV()

where l is the cholesky factor of a hermitian positive
definite tridiagonal matrix a such tha

ZPTTRSV()

where l or u is the cholesky factor of a hermitian positive
definite tridiagonal matrix a such tha

definitions

CLAHQR2()

..
.. statement function definitions .
.. executable statements ..

PCHEEV()

lwork   (local input) integer
see below for definitions of variables used to define lwork
lwork >= max( nb*( np0+1 ), 3 ) +3*n

PCHEEVX()

size of rwork
see below for definitions of variables used to define lrwork
lrwork >= 5 * nn + 4 * n

PCHEGVX()

size of rwork
see below for definitions of variables used to define lrwork
lrwork >= 5 * nn + 4 * n

PCLAHQR()

..
.. statement function definitions .
.. executable statements ..

PCLATTRS()

..
.. statement function definitions .
.. executable statements ..

PDSYEV()

lwork   (local input) integer
see below for definitions of variables used to define lwork
lwork >= 5*n + sizesytrd + 1

PDSYEVX()

size of work
see below for definitions of variables used to define lwork
lwork >= 5 * n + max( 5 * nn, nb * ( np0 + 1 ) )

PDSYGVX()

lwork   (local input) integer
see below for definitions of variables used to define lwork
lwork >= 5 * n + max( 5 * nn, nb * ( np0 + 1 ) )

PSSYEV()

lwork   (local input) integer
see below for definitions of variables used to define lwork
lwork >= 5*n + sizesytrd + 1

PSSYEVX()

size of work
see below for definitions of variables used to define lwork
lwork >= 5 * n + max( 5 * nn, nb * ( np0 + 1 ) )

PSSYGVX()

lwork   (local input) integer
see below for definitions of variables used to define lwork
lwork >= 5 * n + max( 5 * nn, nb * ( np0 + 1 ) )

PZHEEV()

lwork   (local input) integer
see below for definitions of variables used to define lwork
lwork >= max( nb*( np0+1 ), 3 ) +3*n

PZHEEVX()

size of rwork
see below for definitions of variables used to define lrwork
lrwork >= 5 * nn + 4 * n

PZHEGVX()

size of rwork
see below for definitions of variables used to define lrwork
lrwork >= 5 * nn + 4 * n

PZLAHQR()

..
.. statement function definitions .
.. executable statements ..

PZLATTRS()

..
.. statement function definitions .
.. executable statements ..

ZLAHQR2()

..
.. statement function definitions .
.. executable statements ..

deflate

PDLAED2()

pdlaed2 sorts the two sets of eigenvalues together into a single
sorted set.  then it tries to deflate the size of the problem
eigenvalues are close together or if there is a tiny entry in the

PSLAED2()

pslaed2 sorts the two sets of eigenvalues together into a single
sorted set.  then it tries to deflate the size of the problem
eigenvalues are close together or if there is a tiny entry in the

deflated

PDLAED2()

k      (output) integer
the number of non-deflated eigenvalues, and the order of th

PDLAED3()

k      (output) integer
the number of non-deflated eigenvalues, and the order of th

PSLAED2()

k      (output) integer
the number of non-deflated eigenvalues, and the order of th

PSLAED3()

k      (output) integer
the number of non-deflated eigenvalues, and the order of th

deflating

PDLAED1()

the first stage consists of deflating the size of the proble
the z vector.  for each such occurence the dimension of the

PSLAED1()

the first stage consists of deflating the size of the proble
the z vector.  for each such occurence the dimension of the

deflation

PDLAED2()

sorted set.  then it tries to deflate the size of the problem.
there are two ways in which deflation can occur:  when two or mor
z vector.  for each such occurrence the order of the related secular

PDLAED3()

w      (global output) double precision array, dimension (n)
the first k values of the final deflation-altered z-vecto

PSLAED2()

sorted set.  then it tries to deflate the size of the problem.
there are two ways in which deflation can occur:  when two or mor
z vector.  for each such occurrence the order of the related secular

PSLAED3()

w      (global output) real array, dimension (n)
the first k values of the final deflation-altered z-vecto

defs

PCLAHQR()

"a" row defs : main row transforms from localk to locali

PDLAHQR()

"a" row defs : main row transforms from localk to locali

PSLAHQR()

"a" row defs : main row transforms from localk to locali

PZLAHQR()

"a" row defs : main row transforms from localk to locali

degradation

PCHEEVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
pcstein will perform no better than cstein on 1

PCHEGVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
pcstein will perform no better than cstein on 1 processor.

PDSYEVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
pdstein will perform no better than dstein on 1

PDSYGVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
pdstein will perform no better than dstein on 1 processor.

PSSYEVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
psstein will perform no better than sstein on 1

PSSYGVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
psstein will perform no better than sstein on 1 processor.

PZHEEVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
pzstein will perform no better than zstein on 1

PZHEGVX()

enough space to compute all the eigenvectors
orthogonally will cause serious degradation i
pzstein will perform no better than zstein on 1 processor.

delay

PCHETTRD()

we delay spreading v across to all processor columns (whic
combine the spread of v( : , i-1 ) with the spread of h( : , i )

PDSYTTRD()

we delay spreading v across to all processor columns (whic
combine the spread of v( : , i-1 ) with the spread of h( : , i )

PSSYTTRD()

we delay spreading v across to all processor columns (whic
combine the spread of v( : , i-1 ) with the spread of h( : , i )

PZHETTRD()

we delay spreading v across to all processor columns (whic
combine the spread of v( : , i-1 ) with the spread of h( : , i )

Demmel

PCHEEVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

PCHEGVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

PDSYEVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

PDSYGVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

PSSYEVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

PSSYGVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

PZHEEVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

PZHEGVX()

see "computing small singular values of bidiagonal matrices
with guaranteed high relative accuracy," by Demmel an

demonstrate

PCLANHE()

triangular matrix, stopping/starting at the diagonal, which is
the point of reflection.  the pictures below demonstrate this
refered to as rowsums, and the column sums shown by | are refered

PCLANSY()

triangular matrix, stopping/starting at the diagonal, which is
the point of reflection.  the pictures below demonstrate this
refered to as rowsums, and the column sums shown by | are refered

PDLANSY()

triangular matrix, stopping/starting at the diagonal, which is
the point of reflection.  the pictures below demonstrate this
refered to as rowsums, and the column sums shown by | are refered

PSLANSY()

triangular matrix, stopping/starting at the diagonal, which is
the point of reflection.  the pictures below demonstrate this
refered to as rowsums, and the column sums shown by | are refered

PZLANHE()

triangular matrix, stopping/starting at the diagonal, which is
the point of reflection.  the pictures below demonstrate this
refered to as rowsums, and the column sums shown by | are refered

PZLANSY()

triangular matrix, stopping/starting at the diagonal, which is
the point of reflection.  the pictures below demonstrate this
refered to as rowsums, and the column sums shown by | are refered

denote

CDBTRF()

here a11, a21 and a31 denote the current block of jb column
partitioning are jb, i2, i3 respectively, and the numbers

DDBTRF()

here a11, a21 and a31 denote the current block of jb column
partitioning are jb, i2, i3 respectively, and the numbers

PCGEBD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEBRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGERFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHENTRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHETD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHETRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHETTRD()

and assume that its process grid has dimension p x q.
locp( k ) denotes the number of elements of k that a proces
process column.

PCPORFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCTRRFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDGEBD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDGEBRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDGERFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDPORFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDSYNTRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDSYTD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDSYTRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PDSYTTRD()

and assume that its process grid has dimension p x q.
locp( k ) denotes the number of elements of k that a proces
process column.

PDTRRFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSGEBD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSGEBRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSGERFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSPORFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSSYNTRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSSYTD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSSYTRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PSSYTTRD()

and assume that its process grid has dimension p x q.
locp( k ) denotes the number of elements of k that a proces
process column.

PSTRRFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZGEBD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZGEBRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZGERFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZHENTRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZHETD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZHETRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZHETTRD()

and assume that its process grid has dimension p x q.
locp( k ) denotes the number of elements of k that a proces
process column.

PZPORFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PZTRRFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

SDBTRF()

here a11, a21 and a31 denote the current block of jb column
partitioning are jb, i2, i3 respectively, and the numbers

ZDBTRF()

here a11, a21 and a31 denote the current block of jb column
partitioning are jb, i2, i3 respectively, and the numbers

denoted

PCGETRI()

factorization computed by pcgetrf. this method inverts u and then
computes the inverse of sub( a ) = a(ia:ia+n-1,ja:ja+n-1) denoted

PCTRTRS()

distributed matrix of order n, and b(ib:ib+n-1,jb:jb+nrhs-1) is an
n-by-nrhs distributed matrix denoted by sub( b ). a check is mad

PDGETRI()

factorization computed by pdgetrf. this method inverts u and then
computes the inverse of sub( a ) = a(ia:ia+n-1,ja:ja+n-1) denoted

PDTRTRS()

distributed matrix of order n, and b(ib:ib+n-1,jb:jb+nrhs-1) is an
n-by-nrhs distributed matrix denoted by sub( b ). a check is mad

PSGETRI()

factorization computed by psgetrf. this method inverts u and then
computes the inverse of sub( a ) = a(ia:ia+n-1,ja:ja+n-1) denoted

PSTRTRS()

distributed matrix of order n, and b(ib:ib+n-1,jb:jb+nrhs-1) is an
n-by-nrhs distributed matrix denoted by sub( b ). a check is mad

PZGETRI()

factorization computed by pzgetrf. this method inverts u and then
computes the inverse of sub( a ) = a(ia:ia+n-1,ja:ja+n-1) denoted

PZTRTRS()

distributed matrix of order n, and b(ib:ib+n-1,jb:jb+nrhs-1) is an
n-by-nrhs distributed matrix denoted by sub( b ). a check is mad

denotes

PCDBSV()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCDBTRS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCDTSV()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCDTTRS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGBSV()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGBTRS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEBD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEBRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGECON()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEEQU()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEHD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEHRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGELQ2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGELQF()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGELS()

where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n
vectors b and solution vectors x can be handled in a single call;

PCGEQL2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEQLF()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEQPF()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEQR2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGEQRF()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGERFS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGERQ2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGERQF()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGESV()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGESVD()

let k be the number of rows or columns of a distributed matrix, and
assume that its process grid has dimension r x c. locr( k ) denotes
distributed over the r processes of its process column. similarly,

PCGESVX()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGETF2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGETRF()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGETRI()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCGETRS()

factorization computed by pcgetrf.
sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1), op( a ) = a, a**t or a**

PCGGQRF()

where inv( sub( b ) ) denotes the inverse of the matrix sub( b )

PCGGRQF()

where inv( sub( b ) ) denotes the inverse of the matrix sub( b )

PCHEEV()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHEEVX()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHEGS2()

in the following sub( a ) denotes a( ia:ia+n-1, ja:ja+n-1 ) an

PCHEGST()

in the following sub( a ) denotes a( ia:ia+n-1, ja:ja+n-1 ) an

PCHEGVX()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHENGST()

in the following sub( a ) denotes a( ia:ia+n-1, ja:ja+n-1 ) an

PCHENTRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHETD2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHETRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCHETTRD()

and assume that its process grid has dimension p x q.
locp( k ) denotes the number of elements of k that a proces
process column.

PCLABRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLACGV()

pclacgv conjugates a complex vector of length n, sub( x ), where
sub( x ) denotes x(ix,jx:jx+n-1) if incx = descx( m_ ) an

PCLACON()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLACONSB()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLACP2()

distributed matrix b.  no communication is performed, pclacp2
performs a local copy sub( a ) := sub( b ), where sub( a ) denotes
pclacp2 requires that only dimension of the matrix operands is

PCLACP3()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLACPY()

distributed matrix b.  no communication is performed, pclacpy
performs a local copy sub( a ) := sub( b ), where sub( a ) denotes

PCLAEVSWP()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLAHRD()

this is an auxiliary routine called by pcgehrd. in the following
comments sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1)
arguments

PCLANGE()

where norm1 denotes the  one norm of a matrix (maximum column sum)
normf denotes the  frobenius norm of a matrix (square root of sum of

PCLAPIV()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLAPV2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLAQGE()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLAQSY()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLARFB()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLARFG()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLARFT()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLARZB()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLARZT()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLASCL()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLASE2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLASET()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLASMSUB()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLASSQ()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLASWP()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLATRA()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLATRD()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLATRZ()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLAUU2()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLAUUM()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCLAWIL()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCMAX1()

where sub( x ) denotes x(ix:ix+n-1,jx) if incx = 1

PCPBSV()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCPBTRS()

and assume that its process grid has dimension p x q.
locr( k ) denotes the number of elements of k that a proces
process column.

PCPOCON()