/usr/include/ITK-4.9/itpack.h is in libinsighttoolkit4-dev 4.9.0-4ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef __itpack_h
#define __itpack_h
#include "v3p_netlib.h"
#include "v3p_f2c_mangle.h"
extern "C" {
/**
* \file itpack.h
* \brief Declarations of functions from itpack.
*
* The following are the common parameters that are used when calling
* functions. Note: Variables names are consistent with itpack to prevent
* confusion.
*
* nn Order of linear system
* a Row pointers used in compressed row storage format
* m ja Column indices used in compressed row storage format
* \param a Nonzero entries in compressed row storage format
* \param rhs Right hand side of linear system
* \param u Initial guess of solution. holds solution on output
* \param iwksp Vector of length 3*nn. on output: holds permutation vector, its inverse, and integer workspace
* \param nw On input: length of wksp, on output: actual amount used
* \param wksp Vector used for real working space. must be at least nw in length
* \param iparm Vector of length 12 used to initialize various parameters on input
* \param rparm Vector of length 12 used to initialize various parameters on input
* \param ierr Error flag, on output: zero=no error, non-zero=error condition
* \param nz Number of non-zero entries in matrix
* \param iwork Vector of length nz. matrix creation workspace
* \param i Matrix index
* \param j Matrix index
* \param value Matrix entry
* \param mode Type of matrix building
* \param level Error reporting flag
* \param nout Error reporting location
* \param ier Error flag for matrix building
*/
/**
* Jacobian conjugate gradient
*
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param u solution array
* \param iwksp int array used by itpack for calculations
* \param nw size of iwskp and wksp
* \param wksp double array used by itpack for calculations
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
* \param ierr holds error flag on return
*/
extern int jcg_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, integer *iwksp,
integer *nw, doublereal *wksp, integer *iparm, doublereal *rparm,
integer *ierr);
/**
* Jacobian semi-iteration
*
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param u solution array
* \param iwksp int array used by itpack for calculations
* \param nw size of iwskp and wksp
* \param wksp double array used by itpack for calculations
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
* \param ierr holds error flag on return
*/
extern int jsi_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, integer *iwksp,
integer *nw, doublereal *wksp, integer *iparm, doublereal *rparm,
integer *ierr);
/**
* Successive overrelaxation
*
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param u solution array
* \param iwksp int array used by itpack for calculations
* \param nw size of iwskp and wksp
* \param wksp double array used by itpack for calculations
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
* \param ierr holds error flag on return
*/
extern int sor_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, integer *iwksp,
integer *nw, doublereal *wksp, integer *iparm, doublereal *rparm,
integer *ierr);
/**
* Symmetric successive overrelaxation conjugate gradient
*
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param u solution array
* \param iwksp int array used by itpack for calculations
* \param nw size of iwskp and wksp
* \param wksp double array used by itpack for calculations
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
* \param ierr holds error flag on return
*/
extern int ssorcg_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, integer *iwksp,
integer *nw, doublereal *wksp, integer *iparm, doublereal *rparm,
integer *ierr);
/**
* Symmetric successive overrelaxation semi-iteration
*
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param u solution array
* \param iwksp int array used by itpack for calculations
* \param nw size of iwskp and wksp
* \param wksp double array used by itpack for calculations
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
* \param ierr holds error flag on return
*/
extern int ssorsi_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, integer *iwksp,
integer *nw, doublereal *wksp, integer *iparm, doublereal *rparm,
integer *ierr);
/**
* Reduced system conjugate gradient
*
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param u solution array
* \param iwksp int array used by itpack for calculations
* \param nw size of iwskp and wksp
* \param wksp double array used by itpack for calculations
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
* \param ierr holds error flag on return
*/
extern int rscg_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, integer *iwksp,
integer *nw, doublereal *wksp, integer *iparm, doublereal *rparm,
integer *ierr);
/**
* Reduced system semi-iteration
*
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param u solution array
* \param iwksp int array used by itpack for calculations
* \param nw size of iwskp and wksp
* \param wksp double array used by itpack for calculations
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
* \param ierr holds error flag on return
*/
extern int rssi_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, integer *iwksp,
integer *nw, doublereal *wksp, integer *iparm, doublereal *rparm,
integer *ierr);
/**
* Performs one iteration of the jacobian conjugate gradiant method
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param u input version of solution vector
* \param u1 value of solution vector at the end of the in-1 iteration, gets filled with newest estimate
* \param d__ solution vector, gets filled with pseudo-residual vector after in iterations
* \param d1 pseudo-residual vector after in-1 iterations, gets filled with newest pseudo-residual vector
* \param dtwd used in computation of acceleration parameeter gamma and the pseudo-residual
* \param tri stores the tridiagonal matrix associated with the eigenvalues of the conjugate gradient ploynomial
*/
extern int itjcg_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *u, doublereal *u1, doublereal *d__,
doublereal *d1, doublereal *dtwd,
doublereal *tri);
/**
* Performs one iteration of the jacobian semi-iteration method
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of linear system
* \param u solution estimate at in iterations
* \param u1 value of solution vector at the end of the in-1 iteration, gets filled with newest estimate
* \param d__ solution vector, gets filled with pseudo-residual vector after in iterations
* \param icnt number of iterations since last change in solution estimate
*/
extern int itjsi_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, doublereal *u1,
doublereal *d__,
integer *icnt);
/**
* Performs one iteration of the successive overrelaxation method
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of linear system
* \param u solution estimate array
* \param wk work array of length nn
*/
extern int itsor_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, doublereal *wk);
/**
* Performs one iteration of the symmetric successive overrelaxation conjugate gradient method
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of linear system
* \param u solution estimate at in iterations,
* \param u1 value of solution vector at the end of the in-1 iteration, gets filled with newest estimate
* \param c__ forward residual after in iterations
* \param c1 forward residual after in-1 iterations, filled with in+1 values
* \param d__ used to compute backward pseudo-residual for current iteration
* \param dl used in computation of acceleration parameters
* \param wk work array of length nn
* \param tri stores the tridiagonal matrix associated with the eigenvalues of the conjugate gradient ploynomial
*/
extern int itsrcg_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, doublereal *u1,
doublereal *c__, doublereal *c1, doublereal *d__, doublereal *dl, doublereal *wk,
doublereal *tri);
/**
* Performs one iteration of the symmetric successive overrelaxation semi-iteration method
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of linear system
* \param u solution estimate at in-1 iterations
* \param u1 value of solution vector at the end of the in-1 iteration, gets filled with newest estimate
* \param c__ used to compute forward pseudo-residual vector
* \param d__ used to compute backward pseudo-residual vector
* \param ctwd used in computation of acceleration parameters
* \param wk work array of length nn
*/
extern int itsrsi_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, doublereal *u1,
doublereal *c__, doublereal *d__, doublereal *ctwd,
doublereal *wk);
/**
* Performs one iteration of the reduced system conjugate gradient method
* \param n Order of linear system
* \param nnb Number of black points
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param ub estimate for the solution of black points after in iterations
* \param ub1 estimate for the solution of black points after in-1 iterations, filled with in+1 values
* \param db pseudo-residual of black points after in iterations
* \param db1 pseudo-residual of black points after in-1 iterations, filled with in+1 values
* \param wb used in computation involving black vector
* \param tri stores the tridiagonal matrix associated with the eigenvalues of the conjugate gradient ploynomial
*/
extern int itrscg_(integer *n, integer *nnb, integer *ia, integer *ja, doublereal *a, doublereal *ub, doublereal *ub1,
doublereal *db, doublereal *db1, doublereal *wb,
doublereal *tri);
/**
* Performs one iteration of the reduced system semi-iteration method
* \param n Order of linear system
* \param nnb Number of black points
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of linear system
* \param ub estimate for the solution of black points after in iterations
* \param ub1 pseudo-residual of black points after in-1 iterations, filled with in+1 values
* \param db current residual
*/
extern int itrssi_(integer *n, integer *nnb, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *ub,
doublereal *ub1,
doublereal *db);
/**
* Function which uses a bisection search to find the entry j in the
* array k such that the value l is greater than or equal to k[j]
* and strictly less than k[j+1]
* \param n since of array
* \param k integer array to search
* \param l searching criterion
*/
extern integer bisrch_(integer *n, integer *k, integer *l);
/**
* Computes the solution to the chebyshev equation
* \param qa ratio of pseudo-residuals
* \param qt virtual spectral radius
* \param rrr adaptive parameter
* \param ip number of iterations since last change of parameters
* \param cme estimate for largest eigen-value of iteration matrix
* \param sme estimate for smallest eigen-value of iteration matrix
*/
extern doublereal cheby_(doublereal *qa, doublereal *qt, doublereal *rrr, integer *ip, doublereal *cme, doublereal *sme);
/**
* Computes estimate for largest eigenvalue for conjugate gradient acceleration
* \param tri tridiagonal matrix associated with the eigenvalues of the conjugate gradient polynomial
* \param gamold previous value of acceleration parameters
* \param rhoold previous value of acceleration parameters
* \param ibmth flag indicating method being accelerated by conjugate gradient
* 1 - jacobian
* 2 - reduced system
* 3 - ssor
*/
extern int chgcon_(doublereal *tri, doublereal *gamold, doublereal *rhoold, integer *ibmth);
/**
* Computes new chebyshev acceleration parameters adaptively
* \param dtnrm numerator or rayleigh quotient
* \param ibmth indicator of basic method being accelerated by si
* 1 = jacobi
* 2 = reduced system
* 3 = symmetric sor
*/
extern int chgsi_(doublereal *dtnrm, integer *ibmth);
/**
* Tests for jacobi si whether sme should be changed when caseII = false
* if the test is positive, the new value of sme is computed
* \param oldnrm square of the norm of the pseudo-residual at the last iteration
* \param icnt number of iterations since last change of parameters
*/
extern logical chgsme_(doublereal *oldnrm, integer *icnt);
/**
* Overwrite double precision dy with double precision da*dx + dy
* \param n length of da
* \param da array of da values
* \param dx array of dx values
* \param incx increment size for dx array
* \param dy array of dy values
* \param incy increment size for dy array
*/
extern int daxpy_(integer *n, doublereal *da, doublereal *dx, integer *incx, doublereal *dy, integer *incy);
/**
* Copy dx to dy
* \param n length of dx
* \param dx array of values
* \param incx increment size for dx array
* \param dy array of values
* \param incy increment size for dy array
*/
extern int dcopy_(integer *n, doublereal *dx, integer *incx, doublereal *dy, integer *incy);
/**
* Returns dot product of dx and dy
* \param n length of dx
* \param dx array of values
* \param incx increment size for dx array
* \param dy array of values
* \param incy increment size for dy array
*/
extern doublereal ddot_(integer *n, doublereal *dx, integer *incx, doublereal *dy, integer *incy);
/**
* Subroutine that computes the determinant of a symmetric tridiagonal matrix
* given by tri. det(tri - xlmda*i) = 0
* \param n order of tridiagonal system
* \param tri symmetric tridiagonal matrix of order n
* \param xlmda argument for characteristic equation
*/
extern doublereal determ_(integer *n, doublereal *tri, doublereal *xlmda);
/**
* Obtain default parameters
* \param iparm array of 12 integer parameters
* \param rparm array of 12 double parameters
*/
extern int dfault_(integer *iparm, doublereal *rparm);
/**
* This routine initializes the itpack common blocks from the information
* contained in IPARM and RPARM. echall_ also prints the values of all the
* parameters in IPARM and RPARM
* \param nn Order of linear system
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param rhs array of right hand side of system
* \param iparm integer array of parameters
* \param rparm doublereal array of parameters
* \param icall indicator of which parameters are being printed
* \note in this implementation...all printing is disabled
*/
extern int echall_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, integer *iparm,
doublereal *rparm,
integer *icall);
/**
* This routine initiazes the itpack common blocks from IPARM and RPARM
* \param iparm integer array of parameters
* \param rparm doublereal array of parameters
* \param imthd indicator of method
* 1 = jcg
* 2 = jsi
* 3 = sor
* 4 = ssorcg
* 5 = ssorsi
* 6 = rscg
* 7 = rssi
*/
extern int echout_(integer *iparm, doublereal *rparm, integer *imthd);
/**
* Computes the largest eigenvalue of symmetric tridiagnoncal matrix
* for conjugate gradient acceleration
* \param n order of tridiagonal system
* \param tri symmetric tridiagonal matrix of order n
* \param d__ array of eqrt1s (negative diagonal elements)
* \param e2 array of eqrt1s (super diagonal elements)
* \param ier error flag (0 = success)
*/
extern doublereal eigvns_(integer *n, doublereal *tri, doublereal *d__, doublereal *e2, integer *ier);
/**
* Computes the largest eigenvalue of a symmetric tridiagonal matrix for conjugate gradient acceleration
* modified imsl routine zbrent is used
* \param n order of tridiagonal system
* \param tri symmetric tridiagonal matrix of order n
* \param start initial lower bound of interval containing root
* \param zeta stopping criteria
* \param itmax maximum number of iterations
* \param ier error flag (0 = success)
*/
extern doublereal eigvss_(integer *n, doublereal *tri, doublereal *start, doublereal *zeta, integer *itmax,
integer *ier);
/**
* Smallest or largest m eigenvalue of a symmetric tridiagonal matrix
* \param d__ input vector of length n, contains diagonal elements of matrix
* the computed eigenvalues replace the first m components
* \param e2 input vector of length n containing the squares of the off-diagonal elements of the matrix
* \param nn order of the matrix
* \param m number of smallest eigenvalues desired
* \param isw positive definite flag (0 = not pd, 1 = pd)
* \param ierr error flag (601 = interates not monotone increasing, 602 = not really pd)
*/
extern int eqrt1s_(doublereal *d__, doublereal *e2, integer *nn, integer *m, integer *isw, integer *ierr);
/**
* Finds the smallest integer, ipstr, greater than 5 such that
* ipstr * (omega-1)**(ipstr-1) <= 0.5
* \param omega relaxation factor for sor method
*/
extern integer ipstr_(doublereal *omega);
/**
* This routine produces the iteration summary line at the end of each iteration
* if level = 5, the latest approx to the solution is printed
* \param nn order of system
* \param a iteration matrix
* \param u solution estimate
* \param wk work array of length nn
* \param imthdd indicator of method
* 1 = jcg
* 2 = jsi
* 3 = sor
* 4 = ssorcg
* 5 = ssorsi
* 6 = rscg
* 7 = rssi
*/
extern int iterm_(integer *nn, doublereal *a, doublereal *u, doublereal *wk, integer *imthdd);
/**
* Fill integer array with a value
* \param n number of elements in array
* \param iv pointer to integer array
* \param ival value to fill array with
*/
extern int ivfill_(integer *n, integer *iv, integer *ival);
/*
* FIXME: add doc
*/
extern int omeg_(doublereal *dnrm, integer *iflag);
/*
* FIXME: add doc
*/
extern logical omgchg_(integer *ndummy);
/*
* FIXME: add doc
*/
extern logical omgstr_(integer *ndummy);
/*
* FIXME: add doc
*/
extern int parcon_(doublereal *dtnrm, doublereal *c1, doublereal *c2, doublereal *c3, doublereal *c4,
doublereal *gamold, doublereal *rhotmp,
integer *ibmth);
/*
* FIXME: add doc
*/
extern int parsi_(doublereal *c1, doublereal *c2, doublereal *c3, integer *ibmth);
/*
* FIXME: add doc
*/
extern doublereal pbeta_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *v, doublereal *w1,
doublereal *w2);
/*
* FIXME: add doc
*/
extern int pbsor_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *u, doublereal *rhs);
/*
* FIXME: add doc
*/
extern int permat_(integer *nn, integer *ia, integer *ja, doublereal *a, integer *p, integer *newia, integer *isym,
integer *level, integer *nout,
integer *ierr);
/*
* FIXME: add doc
*/
extern int perror_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, doublereal *w,
doublereal *digtt1, doublereal *digtt2,
integer *idgtts);
/*
* FIXME: add doc
*/
extern int pervec_(integer *n, doublereal *v, integer *p);
/*
* FIXME: add doc
*/
extern int pfsor_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *u, doublereal *rhs);
/*
* FIXME: add doc
*/
extern int pfsor1_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *u, doublereal *rhs);
/*
* FIXME: add doc
*/
extern int pjac_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *u, doublereal *rhs);
/*
* FIXME: add doc
*/
extern int pmult_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *u, doublereal *w);
/*
* FIXME: add doc
*/
extern int prbndx_(integer *nn, integer *nblack, integer *ia, integer *ja, integer *p, integer *ip, integer *level,
integer *nout,
integer *ier);
/*
* FIXME: add doc
*/
extern int prsblk_(integer *nnb, integer *nnr, integer *ia, integer *ja, doublereal *a, doublereal *ur, doublereal *vb);
/*
* FIXME: add doc
*/
extern int prsred_(integer *nnb, integer *nnr, integer *ia, integer *ja, doublereal *a, doublereal *ub, doublereal *vr);
/*
* FIXME: add doc
*/
extern int pssor1_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *u, doublereal *rhs, doublereal *fr,
doublereal *br);
/*
* FIXME: add doc
*/
extern int pstop_(integer *n, doublereal *u, doublereal *dnrm, doublereal *ccon, integer *iflag, logical *q1);
/*
* FIXME: add doc
*/
extern doublereal pvtbv_(integer *n, integer *ia, integer *ja, doublereal *a, doublereal *v);
/*
* FIXME: add doc
*/
extern int qsort_(integer *nn, integer *key, doublereal *data, integer *error);
/**
* Convert compressed row matrix back to linked-list representation used for adding entires
*/
extern int sbagn_(integer *n, integer *nz, integer *ia, integer *ja, doublereal *a, integer *iwork, integer *levell,
integer *noutt,
integer *ierr);
/*
* FIXME: add doc
*/
extern int sbelm_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, integer *iw, doublereal *rw,
doublereal *tol, integer *isym, integer *level, integer *nout,
integer *ier);
/**
* Finalize matrix storage format
* \param nn order of matrix
* \param nz maximum number of non-zero values
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param iwork workspace array used by itpack
*/
extern int sbend_(integer *nn, integer *nz, integer *ia, integer *ja, doublereal *a, integer *iwork);
/**
* Initialize sparse matrix storage
* \param nn order of matrix
* \param nz maximum number of non-zero values
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param iwork workspace array used by itpack
*/
extern int sbini_(integer *nn, integer *nz, integer *ia, integer *ja, doublereal *a, integer *iwork);
/**
* Insert entry into sparse matrix
* \param nn order of matrix
* \param nz maximum number of non-zero values
* \param ia array of row offsets
* \param ja array of column indices
* \param a array of matrix values
* \param iwork workspace array used by itpack
* \param ii row index of value to add
* \param jj column index of value to add
* \param vall value to add
* \param mode flag for type of adding to be done
* \param levell specifier for level of output
* \param noutt specifier for output
* \param ierr holds error flag on return
*/
extern int sbsij_(integer *nn, integer *nz, integer *ia, integer *ja, doublereal *a, integer *iwork, integer *ii,
integer *jj, doublereal *vall, integer *mode, integer *levell, integer *noutt,
integer *ierr);
/*
* FIXME: add doc
*/
extern int scal_(integer *nn, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, doublereal *d__,
integer *level, integer *nout,
integer *ier);
/*
* FIXME: add doc
*/
extern int sum3_(integer *n, doublereal *c1, doublereal *x1, doublereal *c2, doublereal *x2, doublereal *c3,
doublereal *x3);
/*
* FIXME: add doc
*/
extern doublereal tau_(integer *ii);
/*
* FIXME: add doc
*/
extern E_f timer_(v3p_netlib_real *timdmy);
/*
* FIXME: add doc
*/
extern logical tstchg_(integer *ibmth);
/*
* FIXME: add doc
*/
extern int unscal_(integer *n, integer *ia, integer *ja, doublereal *a, doublereal *rhs, doublereal *u, doublereal *d__);
/*
* FIXME: add doc
*/
extern int vevmw_(integer *n, doublereal *v, doublereal *w);
/*
* FIXME: add doc
*/
extern int vevpw_(integer *n, doublereal *v, doublereal *w);
/**
* Fill all entires of nn-sized array u with value
* \param n size of array
* \param v array
* \param val value to fill array with
*/
extern int vfill_(integer *n, doublereal *v, doublereal *val);
/*
* FIXME: add doc
*/
extern int vout_(integer *n, doublereal *v, integer *iswt, integer *noutt);
/*
* FIXME: add doc
*/
extern int wevmw_(integer *n, doublereal *v, doublereal *w);
/*
* FIXME: add doc
*/
extern int zbrent_(integer *n, doublereal *tri, doublereal *eps, integer *nsig, doublereal *aa, doublereal *bb,
integer *maxfnn,
integer *ier);
}
#include "v3p_f2c_unmangle.h"
#endif // #ifndef __itpack_h
|