arpack /ARPACK/EXAMPLES/BAND /dsband.f
10. c (1) The corresponding approximate eigenvectors;
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c dsband can be called with one of the following modes:
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c dsband can be called with one of the following modes:
38 matches | 861 lines | Fortran 77 | GitHub
exciting /src/ARPACK/EXAMPLES/BAND /dsband.f
10. c (1) The corresponding approximate eigenvectors;
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c dsband can be called with one of the following modes:
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c dsband can be called with one of the following modes:
38 matches | 861 lines | text | GitHub
msysgit /mingw/lib/gcc/mingw32/4.4.0/include/c++/bits /locale_facets.h
3. // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
4. // 2006, 2007, 2008, 2009
5. // Free Software Foundation, Inc.
6. //
7. // This file is part of the GNU ISO C++ Library. This library is free
26.
27. /** @file locale_facets.h
28. * This is an internal header file, included by other library headers.
29. * You should not attempt to use it directly.
30. */
39. #pragma GCC system_header
40.
41. #include <cwctype> // For wctype_t
42. #include <cctype>
43. #include <bits/ctype_base.h>
4. // 2006, 2007, 2008, 2009
5. // Free Software Foundation, Inc.
6. //
7. // This file is part of the GNU ISO C++ Library. This library is free
26.
27. /** @file locale_facets.h
28. * This is an internal header file, included by other library headers.
29. * You should not attempt to use it directly.
30. */
39. #pragma GCC system_header
40.
41. #include <cwctype> // For wctype_t
42. #include <cctype>
43. #include <bits/ctype_base.h>
215 matches | 1929 lines | C/C++ Header | Google Code
arpack /ARPACK/EXAMPLES/BAND /snband.f
96. c with DR.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Real (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Real (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
37 matches | 1386 lines | Fortran 77 | GitHub
exciting /src/ARPACK/EXAMPLES/BAND /snband.f
96. c with DR.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Real (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Real (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
37 matches | 1386 lines | text | GitHub
snake-os /tools/arm-uclibc-3.4.6/include/c++/3.4.6/bits /locale_facets.h
2.
3. // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
4. // Free Software Foundation, Inc.
5. //
6. // This file is part of the GNU ISO C++ Library. This library is free
22. // As a special exception, you may use this file as part of a free software
23. // library without restriction. Specifically, if other files instantiate
24. // templates or use macros or inline functions from this file, or you compile
25. // this file and link it with other files to produce an executable, this
26. // file does not by itself cause the resulting executable to be covered by
34.
35. /** @file locale_facets.h
36. * This is an internal header file, included by other library headers.
37. * You should not attempt to use it directly.
38. */
3. // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
4. // Free Software Foundation, Inc.
5. //
6. // This file is part of the GNU ISO C++ Library. This library is free
22. // As a special exception, you may use this file as part of a free software
23. // library without restriction. Specifically, if other files instantiate
24. // templates or use macros or inline functions from this file, or you compile
25. // this file and link it with other files to produce an executable, this
26. // file does not by itself cause the resulting executable to be covered by
34.
35. /** @file locale_facets.h
36. * This is an internal header file, included by other library headers.
37. * You should not attempt to use it directly.
38. */
213 matches | 1919 lines | C/C++ Header | Google Code
fb2pdf /test /Agata_Kristi_Angliyskiy_yazyik_s_Agatoy_Kristi._Ubiystva_po_alfavitu.fb2
1. <?xml version="1.0" encoding="utf-8"?>
2. <FictionBook xmlns="http://www.gribuser.ru/xml/fictionbook/2.0" xmlns:l="http://www.w3.org/1999/xlink">
3. <description>
33. <p>?????????????? ?????? ???? ??????: <a l:href="http://www.franklang.ru/">www.franklang.ru</a></p>
34. <empty-line/>
35. <p>?? ????????? fb2. ???? ??? ??????? ?????????? ????????????: UTF-LATIN ? ASCII-IPA. ??? ??????????? ??????????? UTF-LATIN ?????????? ??????????? ????????? ??????, ????????, DejaVu ??? Arial Unicode MS. ???? ?? ????? ???? ???????? ??? ??? ?? ??????????, ?? ?????????????? ASCII-IPA ??????? ??? ?? ????? ????? (?????????? ?????? ???????????? ????????????). ?? ??? ?????????? ? ?????????? ??????????? ?????????? ?? ????????? ?????. ????? ???????? ?? ASCII-IPA ??????? ? ?????????:</p>
36. <p>
37. <a l:href="http://alt-usage-english.org/ipa/ascii_ipa_combined.shtml">http://alt-usage-english.org/ipa/ascii_ipa_combined.shtml</a>
45. <lang>ru</lang>
46. <src-lang>en</src-lang>
47. <sequence name="????? ?????? ???? ??????"/>
48. </title-info>
49. <document-info>
50. <author>
51. <nickname>Pavel_V</nickname>
2. <FictionBook xmlns="http://www.gribuser.ru/xml/fictionbook/2.0" xmlns:l="http://www.w3.org/1999/xlink">
3. <description>
33. <p>?????????????? ?????? ???? ??????: <a l:href="http://www.franklang.ru/">www.franklang.ru</a></p>
34. <empty-line/>
35. <p>?? ????????? fb2. ???? ??? ??????? ?????????? ????????????: UTF-LATIN ? ASCII-IPA. ??? ??????????? ??????????? UTF-LATIN ?????????? ??????????? ????????? ??????, ????????, DejaVu ??? Arial Unicode MS. ???? ?? ????? ???? ???????? ??? ??? ?? ??????????, ?? ?????????????? ASCII-IPA ??????? ??? ?? ????? ????? (?????????? ?????? ???????????? ????????????). ?? ??? ?????????? ? ?????????? ??????????? ?????????? ?? ????????? ?????. ????? ???????? ?? ASCII-IPA ??????? ? ?????????:</p>
36. <p>
37. <a l:href="http://alt-usage-english.org/ipa/ascii_ipa_combined.shtml">http://alt-usage-english.org/ipa/ascii_ipa_combined.shtml</a>
45. <lang>ru</lang>
46. <src-lang>en</src-lang>
47. <sequence name="????? ?????? ???? ??????"/>
48. </title-info>
49. <document-info>
50. <author>
51. <nickname>Pavel_V</nickname>
1295 matches | 8949 lines | Unknown | Google Code
hare /sys/doc/CURRY /all.bib
3. Pollack and Daniel M. Reeves",
4. title = "Personal Secure Booting",
5. journal = "Lecture Notes in Computer Science",
6. volume = "2119",
7. pages = "130--??",
9. url = "citeseer.ist.psu.edu/article/itoi01personal.html" }
10.
11. @article{hendriksminnich,
12. author="Erik Hendriks and Ronald G. Minnich",
13. title="How to build a fast and reliable 1024 node cluster with only one disk",
14. journal="Journal of Supercomputing",
20. author = "Matt Blaze",
21. title = "A Cryptographic File System for {UNIX}",
22. booktitle = "{ACM} Conference on Computer and Communications Security",
23. pages = "9-16",
4. title = "Personal Secure Booting",
5. journal = "Lecture Notes in Computer Science",
6. volume = "2119",
7. pages = "130--??",
9. url = "citeseer.ist.psu.edu/article/itoi01personal.html" }
10.
11. @article{hendriksminnich,
12. author="Erik Hendriks and Ronald G. Minnich",
13. title="How to build a fast and reliable 1024 node cluster with only one disk",
14. journal="Journal of Supercomputing",
20. author = "Matt Blaze",
21. title = "A Cryptographic File System for {UNIX}",
22. booktitle = "{ACM} Conference on Computer and Communications Security",
23. pages = "9-16",
152 matches | 1873 lines | Unknown | Bitbucket
freepascal /utils/fpdoc/fpde /xpms.pp
338. ' 2 3 ~ ~ ~ ~ ~ ~ ~ 4 5 6 7 , 8 9 0 a '' ',
339. ' b c ~ ~ ~ ~ ~ ~ d 5 e f g h i j k k l ',
340. ' m c ~ ~ ~ ~ ~ : n o p q r s t u v w x ',
341. ' y c ~ ~ ~ ~ d z A B C D E F G H I J K ',
342. ' L M ~ ~ ~ d z o N O D E F P Q R S T U ',
339. ' b c ~ ~ ~ ~ ~ ~ d 5 e f g h i j k k l ',
340. ' m c ~ ~ ~ ~ ~ : n o p q r s t u v w x ',
341. ' y c ~ ~ ~ ~ d z A B C D E F G H I J K ',
342. ' L M ~ ~ ~ d z o N O D E F P Q R S T U ',
1 matches | 2237 lines | Pascal | GitHub
freepascal /utils/fpdoc/fpde /xpms.pp
338. ' 2 3 ~ ~ ~ ~ ~ ~ ~ 4 5 6 7 , 8 9 0 a '' ',
339. ' b c ~ ~ ~ ~ ~ ~ d 5 e f g h i j k k l ',
340. ' m c ~ ~ ~ ~ ~ : n o p q r s t u v w x ',
341. ' y c ~ ~ ~ ~ d z A B C D E F G H I J K ',
342. ' L M ~ ~ ~ d z o N O D E F P Q R S T U ',
339. ' b c ~ ~ ~ ~ ~ ~ d 5 e f g h i j k k l ',
340. ' m c ~ ~ ~ ~ ~ : n o p q r s t u v w x ',
341. ' y c ~ ~ ~ ~ d z A B C D E F G H I J K ',
342. ' L M ~ ~ ~ d z o N O D E F P Q R S T U ',
1 matches | 2237 lines | text | GitHub
nausicaa /lapack/src/libraries/foreign/math/lapack /vm.sls
95. (define (rvc/c len)
96. ;;Allocate an array capable of holding a real vector of LEN elements;
97. ;;return a pointer to it. The appropriate free function is pushed to
98. ;;the current compensations stack.
99. ;;
102. (define (rvc-set! rvc idx val)
103. ;;Store the real value VAL at location IDX in the real vector
104. ;;referenced by the pointer object RVC.
105. ;;
106. (array-set-c-double! rvc idx (inexact val)))
107.
108. (define (rvc-ref rvc idx)
109. ;;Return the real value at location IDX in the real vector referenced
110. ;;by the pointer object RVC.
111. ;;
96. ;;Allocate an array capable of holding a real vector of LEN elements;
97. ;;return a pointer to it. The appropriate free function is pushed to
98. ;;the current compensations stack.
99. ;;
102. (define (rvc-set! rvc idx val)
103. ;;Store the real value VAL at location IDX in the real vector
104. ;;referenced by the pointer object RVC.
105. ;;
106. (array-set-c-double! rvc idx (inexact val)))
107.
108. (define (rvc-ref rvc idx)
109. ;;Return the real value at location IDX in the real vector referenced
110. ;;by the pointer object RVC.
111. ;;
31 matches | 347 lines | Unknown | GitHub
RealTime /gcc/include/c++/4.0.2/bits /locale_facets.h
2.
3. // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
4. // Free Software Foundation, Inc.
5. //
6. // This file is part of the GNU ISO C++ Library. This library is free
22. // As a special exception, you may use this file as part of a free software
23. // library without restriction. Specifically, if other files instantiate
24. // templates or use macros or inline functions from this file, or you compile
25. // this file and link it with other files to produce an executable, this
26. // file does not by itself cause the resulting executable to be covered by
34.
35. /** @file locale_facets.h
36. * This is an internal header file, included by other library headers.
37. * You should not attempt to use it directly.
38. */
3. // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
4. // Free Software Foundation, Inc.
5. //
6. // This file is part of the GNU ISO C++ Library. This library is free
22. // As a special exception, you may use this file as part of a free software
23. // library without restriction. Specifically, if other files instantiate
24. // templates or use macros or inline functions from this file, or you compile
25. // this file and link it with other files to produce an executable, this
26. // file does not by itself cause the resulting executable to be covered by
34.
35. /** @file locale_facets.h
36. * This is an internal header file, included by other library headers.
37. * You should not attempt to use it directly.
38. */
470 matches | 4579 lines | text | GitHub
freebsd-head /contrib/libstdc++/include/bits /locale_facets.h
2.
3. // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
4. // Free Software Foundation, Inc.
5. //
6. // This file is part of the GNU ISO C++ Library. This library is free
22. // As a special exception, you may use this file as part of a free software
23. // library without restriction. Specifically, if other files instantiate
24. // templates or use macros or inline functions from this file, or you compile
25. // this file and link it with other files to produce an executable, this
26. // file does not by itself cause the resulting executable to be covered by
30.
31. /** @file locale_facets.h
32. * This is an internal header file, included by other library headers.
33. * You should not attempt to use it directly.
34. */
3. // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
4. // Free Software Foundation, Inc.
5. //
6. // This file is part of the GNU ISO C++ Library. This library is free
22. // As a special exception, you may use this file as part of a free software
23. // library without restriction. Specifically, if other files instantiate
24. // templates or use macros or inline functions from this file, or you compile
25. // this file and link it with other files to produce an executable, this
26. // file does not by itself cause the resulting executable to be covered by
30.
31. /** @file locale_facets.h
32. * This is an internal header file, included by other library headers.
33. * You should not attempt to use it directly.
34. */
214 matches | 1920 lines | C/C++ Header | Bitbucket
arpack /ARPACK/EXAMPLES/BAND /dnband.f
96. c with DR.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Double precision (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Double precision (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
37 matches | 1386 lines | Fortran 77 | GitHub
arpack /ARPACK/EXAMPLES/BAND /ssband.f
10. c (1) The corresponding approximate eigenvectors;
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c ssband can be called with one of the following modes:
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c ssband can be called with one of the following modes:
38 matches | 861 lines | Fortran 77 | GitHub
rhythmcat /src/imgs /img_nocov.xpm
3825. "kc c #C39C63",
3826. "lc c #BE945B",
3827. "mc c #BD9359",
3828. "nc c #C19961",
3829. "oc c #BC9257",
3830. "pc c #C1965B",
12289."kc. c #EFEFEF",
12290."lc. c #C2C2C2",
12291."mc. c #C8C8C8",
12292."nc. c #F9F9F9",
12293."oc. c #C9C9C9",
12294."pc. c #BBBBBB",
12787." 0 #] .0 +0 @0 #0 r8 $0 %0 s8 &0 *0 ^4 =0 =0 -0 -0 -0 L@ K@ [# }# b$ i$ _% ;0 >0 ,& ,0 {- '0 )0 a; f; !0 k> x; ~0 {0 ]0 ^0 /0 (0 _0 :0 <0 [0 }0 |0 10 20 30 40 50 60 70 80 90 00 a0 b0 c0 d0 e0 f0 g0 h0 i0 j0 k0 l0 m0 n0 o0 p0 q0 r0 s0 A4 t0 u0 v0 w0 x0 y0 z0 A0 B0 C0 D0 E0 L7 F0 G0 H0 I0 J0 K0 L0 M0 Y7 N0 O0 P0 Q0 R0 S0 T0 U0 V0 W0 X0 Y0 Z0 `0 a .a +a @a #a $a %a b2 M| &a *a =a -a ;a >a ,a 'a )a !a ~a {a ]a ^a /a (a _a :a <a [a }a |a 78 1a 2a 3a 4a 5a 6a 7a 8a 9a 0a aa ba ca ",
12788."da g^ n8 ea fa ga ga @0 ha ia $0 ja ka x5 G2 la 4$ ma q8 G# }# 0$ U% _% <% |% na d, >= oa _- pa qa (; ra sa E> ta ua va wa xa ya za Aa Ba Ca Da Ea Fa Ga Ha Ia Ja Ka La Ma Na Oa Pa Qa Ra Sa Ta Ua Va Wa Xa Ya Za `a b .b +b @b #b $b ,9 %b (3 &b *b =b -b ;b >b ,b 'b )b !b ~b {b ]b ^b /b (b _b :b <b &5 99 89 [b }b |b 1b 2b 3b 4b 5b 6b 7b 8b 9b 0b ab bb cb db eb fb gb ab hb ib jb kb lb mb nb ob pb qb rb sb tb ub vb wb xb yb zb Ab Bb Cb Db Eb Fb Gb Hb Ib Jb Kb Lb Mb Nb Ob Pb aa Qb ",
12789."Rb Sb g^ Tb n8 Ub o8 =7 ga Vb Wb Xb Yb Zb `b `b c Yb p8 o8 .0 .c +c @c #c @* `} $c %c (- }= &c *c =c s; -c ;c >c ,c 'c )c !c ~c {c ]c ^c /c (c _c :c <c [c }c |c 1c 2c 3c 4c 5c 6c 7c 8c 9c 0c ac bc cc dc ec fc gc hc ic jc kc lc mc nc oc pc qc rc sc tc uc vc wc xc yc yc zc Ac Bc Cc Dc Ec Fc Gc Hc Y7 Ic Jc Kc Lc |b Mc Nc Oc Pc Qc Rc Sc Tc Uc Vc Wc Xc Yc Zc `c d .d +d @d #d $d %d &d *d =d -d ;d >d ,d 'd )d !d ~d {d ]d ^d /d (d _d :d <d [d }d [d |d 1d 2d 3d 4d 5d 6d 7d 8d 9d 0d ",
3826. "lc c #BE945B",
3827. "mc c #BD9359",
3828. "nc c #C19961",
3829. "oc c #BC9257",
3830. "pc c #C1965B",
12289."kc. c #EFEFEF",
12290."lc. c #C2C2C2",
12291."mc. c #C8C8C8",
12292."nc. c #F9F9F9",
12293."oc. c #C9C9C9",
12294."pc. c #BBBBBB",
12787." 0 #] .0 +0 @0 #0 r8 $0 %0 s8 &0 *0 ^4 =0 =0 -0 -0 -0 L@ K@ [# }# b$ i$ _% ;0 >0 ,& ,0 {- '0 )0 a; f; !0 k> x; ~0 {0 ]0 ^0 /0 (0 _0 :0 <0 [0 }0 |0 10 20 30 40 50 60 70 80 90 00 a0 b0 c0 d0 e0 f0 g0 h0 i0 j0 k0 l0 m0 n0 o0 p0 q0 r0 s0 A4 t0 u0 v0 w0 x0 y0 z0 A0 B0 C0 D0 E0 L7 F0 G0 H0 I0 J0 K0 L0 M0 Y7 N0 O0 P0 Q0 R0 S0 T0 U0 V0 W0 X0 Y0 Z0 `0 a .a +a @a #a $a %a b2 M| &a *a =a -a ;a >a ,a 'a )a !a ~a {a ]a ^a /a (a _a :a <a [a }a |a 78 1a 2a 3a 4a 5a 6a 7a 8a 9a 0a aa ba ca ",
12788."da g^ n8 ea fa ga ga @0 ha ia $0 ja ka x5 G2 la 4$ ma q8 G# }# 0$ U% _% <% |% na d, >= oa _- pa qa (; ra sa E> ta ua va wa xa ya za Aa Ba Ca Da Ea Fa Ga Ha Ia Ja Ka La Ma Na Oa Pa Qa Ra Sa Ta Ua Va Wa Xa Ya Za `a b .b +b @b #b $b ,9 %b (3 &b *b =b -b ;b >b ,b 'b )b !b ~b {b ]b ^b /b (b _b :b <b &5 99 89 [b }b |b 1b 2b 3b 4b 5b 6b 7b 8b 9b 0b ab bb cb db eb fb gb ab hb ib jb kb lb mb nb ob pb qb rb sb tb ub vb wb xb yb zb Ab Bb Cb Db Eb Fb Gb Hb Ib Jb Kb Lb Mb Nb Ob Pb aa Qb ",
12789."Rb Sb g^ Tb n8 Ub o8 =7 ga Vb Wb Xb Yb Zb `b `b c Yb p8 o8 .0 .c +c @c #c @* `} $c %c (- }= &c *c =c s; -c ;c >c ,c 'c )c !c ~c {c ]c ^c /c (c _c :c <c [c }c |c 1c 2c 3c 4c 5c 6c 7c 8c 9c 0c ac bc cc dc ec fc gc hc ic jc kc lc mc nc oc pc qc rc sc tc uc vc wc xc yc yc zc Ac Bc Cc Dc Ec Fc Gc Hc Y7 Ic Jc Kc Lc |b Mc Nc Oc Pc Qc Rc Sc Tc Uc Vc Wc Xc Yc Zc `c d .d +d @d #d $d %d &d *d =d -d ;d >d ,d 'd )d !d ~d {d ]d ^d /d (d _d :d <d [d }d [d |d 1d 2d 3d 4d 5d 6d 7d 8d 9d 0d ",
7 matches | 12822 lines | text | Google Code
exciting /src/ARPACK/EXAMPLES/BAND /dnband.f
96. c with DR.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Double precision (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
97. c
98. c NOTE: When Ritz values are complex, they will come in complex
99. c conjugate pairs. If eigenvectors are requested, the
100. c corresponding Ritz vectors will also come in conjugate
101. c pairs and the real and imaginary parts of these are
102. c represented in two consecutive columns of the array Z
118. c associated with the positive imaginary part.
119. c
120. c If RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
121. c
122. c NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
131. c SIGMAR Double precision (INPUT)
132. c If IPARAM(7) = 3 or 4, represents the real part of the shift.
133. c Not referenced if IPARAM(7) = 1 or 2.
37 matches | 1386 lines | text | GitHub
exciting /src/ARPACK/EXAMPLES/BAND /ssband.f
10. c (1) The corresponding approximate eigenvectors;
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c ssband can be called with one of the following modes:
11. c
12. c (2) An orthonormal (Lanczos) basis for the associated approximate
13. c invariant subspace;
14. c
18. c
19. c There is negligible additional cost to obtain eigenvectors. An orthonormal
20. c (Lanczos) basis is always computed. There is an additional storage cost
21. c of n*nev if both are requested (in this case a separate array Z must be
22. c supplied).
26. c to as such in the comments that follow. The computed orthonormal basis
27. c for the invariant subspace corresponding to these Ritz values is referred
28. c to as a Lanczos basis.
29. c
30. c ssband can be called with one of the following modes:
38 matches | 861 lines | text | GitHub
melody /extlib/Locale/Maketext /TPJ13.pod
24. This article points out cases where gettext (a common system for
25. localizing software interfaces -- i.e., making them work in the user's
26. language of choice) fails because of basic differences between human
27. languages. This article then describes Maketext, a new system capable
28. of correctly treating these differences.
29.
30. =head2 A Localization Horror Story: It Could Happen To You
67. );
68.
69. ...which does the Right Thing. (In case you don't recall, "%g" is for
70. locale-specific number interpolation, and "%s" is for string
71. interpolation.)
73. But you still have to localize it for all the languages you're
74. producing this software for, so you pull Locale::gettext off of CPAN
75. so you can access the C<gettext> C functions you've heard are standard
25. localizing software interfaces -- i.e., making them work in the user's
26. language of choice) fails because of basic differences between human
27. languages. This article then describes Maketext, a new system capable
28. of correctly treating these differences.
29.
30. =head2 A Localization Horror Story: It Could Happen To You
67. );
68.
69. ...which does the Right Thing. (In case you don't recall, "%g" is for
70. locale-specific number interpolation, and "%s" is for string
71. interpolation.)
73. But you still have to localize it for all the languages you're
74. producing this software for, so you pull Locale::gettext off of CPAN
75. so you can access the C<gettext> C functions you've heard are standard
108 matches | 776 lines | Unknown | GitHub
arpack /ARPACK/SRC /ssaupd.f
6. c\Description:
7. c
8. c Reverse communication interface for the Implicitly Restarted Arnoldi
9. c Iteration. For symmetric problems this reduces to a variant of the Lanczos
10. c method. This method has been designed to compute approximations to a
11. c few eigenpairs of a linear operator OP that is real and symmetric
56. c or through an iterative method for solving these
57. c systems. If an iterative method is used, the
58. c convergence test must be more stringent than
59. c the accuracy requirements for the eigenvalue
60. c approximations.
67. c\Arguments
68. c IDO Integer. (INPUT/OUTPUT)
69. c Reverse communication flag. IDO must be zero on the first
70. c call to ssaupd. IDO will be set internally to
7. c
8. c Reverse communication interface for the Implicitly Restarted Arnoldi
9. c Iteration. For symmetric problems this reduces to a variant of the Lanczos
10. c method. This method has been designed to compute approximations to a
11. c few eigenpairs of a linear operator OP that is real and symmetric
56. c or through an iterative method for solving these
57. c systems. If an iterative method is used, the
58. c convergence test must be more stringent than
59. c the accuracy requirements for the eigenvalue
60. c approximations.
67. c\Arguments
68. c IDO Integer. (INPUT/OUTPUT)
69. c Reverse communication flag. IDO must be zero on the first
70. c call to ssaupd. IDO will be set internally to
65 matches | 691 lines | Fortran 77 | GitHub
