twversion (1) - twversion is a graphical user interface (GUI) tool for the Source Code Control System (SCCS). twversion is available as part of the Sun WorkShop TeamWare product. .dbxinit dbxinit (4) - commands to dbx .dbxrc dbxrc (4) - commands to dbx Algorithms Algorithms (3c++/3) - Generic algorithms for performing various operations on containers and sequences. Associative_Containers Associative_Containers (3c++/3) - Associative containers are ordered containers. These containers include member functions that allow key insertion, retrieval, and manipulation. The standard library has the map, multimap, set, and multiset associative containers. map and multimap associate values with the keys and allow for fast retrieval of the value, based upon fast retrieval of the key. set and multiset store only keys, allowing fast retrieval of the key itself. Bidirectional_Iterators Bidirectional_Iterators (3c++/3) - An iterator that can both read and write and can traverse a container in both directions CC CC (1) - Sun WorkShop C++ Compiler 5.0 CCadmin CCadmin (1) - clean the templates database; provide information from and updates to the database. Containers Containers (3c++/3) - A standard template library (STL) collection. Forward_Iterators Forward_Iterators (3c++/3) - A forward-moving iterator that can both read and write. Function_Objects Function_Objects (3c++/3) - Function objects are objects with an operator() defined. They are used as arguments to templatized algorithms, in place of pointers to functions. Input_Iterators Input_Iterators (3c++/3) - A read-only, forward moving iterator. Insert_Iterators Insert_Iterators (3c++/3) - An iterator adaptor that allows an iterator to insert into a container rather than overwrite elements in the container. Interrupt_handler interrupt (3) - signal handling for the task library Intro Intro (3m) - introduction to mathematical library functions and constants Iterators Iterators (3c++/3) - Pointer generalizations for traversal and modification of collections. Negators Negators (3c++/3) - Function adaptors and function objects used to reverse the sense of predicate function objects. Operators Operators (3c++/3) - Operators for the C++ Standard Template Library. Output_Iterators Output_Iterators (3c++/3) - A write-only, forward moving iterator. Predicates Predicates (3c++/3) - A function or a function object that returns a boolean (true/false) value or an integer value. Random_Access_Iterators Random_Access_Iterators (3c++/3) - An iterator that reads, writes, and allows random access to a container. Sequences Sequences (3c++/3) - A sequence is a container that organizes a set of objects of the same type into a linear arrangement. vector, list, deque, and string fall into this category. Sequences offer different complexity trade-offs. vector offers fast inserts and deletes from the end of the container. deque is useful when insertions and deletions take place at the beginning or end of the sequence. Use list when there are frequent insertions and deletions from the middle of the sequence. Stream_Iterators Stream_Iterators (3c++/3) - Stream iterators include iterator capabilities for ostreams and istreams. They allow generic algorithms to be used directly on streams. See the sections istream_iterator and ostream_iterator for a description of these iterators. \ Algorithms (3c++/3) - Generic algorithms for performing various operations on containers and sequences. \ Associative_Containers (3c++/3) - Associative containers are ordered containers. These containers include member functions that allow key insertion, retrieval, and manipulation. The standard library has the map, multimap, set, and multiset associative containers. map and multimap associate values with the keys and allow for fast retrieval of the value, based upon fast retrieval of the key. set and multiset store only keys, allowing fast retrieval of the key itself. \ Bidirectional_Iterators (3c++/3) - An iterator that can both read and write and can traverse a container in both directions \ Containers (3c++/3) - A standard template library (STL) collection. \ Forward_Iterators (3c++/3) - A forward-moving iterator that can both read and write. \ Function_Objects (3c++/3) - Function objects are objects with an operator() defined. They are used as arguments to templatized algorithms, in place of pointers to functions. \ Input_Iterators (3c++/3) - A read-only, forward moving iterator. \ Insert_Iterators (3c++/3) - An iterator adaptor that allows an iterator to insert into a container rather than overwrite elements in the container. \ Iterators (3c++/3) - Pointer generalizations for traversal and modification of collections. \ Negators (3c++/3) - Function adaptors and function objects used to reverse the sense of predicate function objects. \ Operators (3c++/3) - Operators for the C++ Standard Template Library. \ Output_Iterators (3c++/3) - A write-only, forward moving iterator. \ Predicates (3c++/3) - A function or a function object that returns a boolean (true/false) value or an integer value. \ Random_Access_Iterators (3c++/3) - An iterator that reads, writes, and allows random access to a container. \ Sequences (3c++/3) - A sequence is a container that organizes a set of objects of the same type into a linear arrangement. vector, list, deque, and string fall into this category. Sequences offer different complexity trade-offs. vector offers fast inserts and deletes from the end of the container. deque is useful when insertions and deletions take place at the beginning or end of the sequence. Use list when there are frequent insertions and deletions from the middle of the sequence. \ Stream_Iterators (3c++/3) - Stream iterators include iterator capabilities for ostreams and istreams. They allow generic algorithms to be used directly on streams. See the sections istream_iterator and ostream_iterator for a description of these iterators. \ __distance_type (3c++/3) - Determines the type of distance used by an iterator. This function is now obsolete. It is retained in order to include backward compatibility and support compilers that do not include partial specialization. \ __iterator_category (3c++/3) - Determines the category to which an iterator belongs. This function is now obsolete. It is included for backward compatibility and to support compilers that do not include partial specialization. \ __reverse_bi_iterator (3c++/3) - An iterator that traverses a collection backwards. __reverse_bi_iterator is included for those compilers that do not support partial specialization. The template signature for reverse_iterator matches that of __reverse_bi_iterator when partial specialization is not available (in other words, it has six template parameters rather than one). \ accumulate (3c++/3) - Accumulates all elements within a range into a single value. \ adjacent_difference (3c++/3) - Outputs a sequence of the differences between each adjacent pair of elements in a range. \ adjacent_find (3c++/3) - Find the first adjacent pair of elements in a sequence that are equivalent. \ advance (3c++/3) - Moves an iterator forward or backward (if available) by a certain distance. \ allocator (3c++/3) - The default allocator object for storage management in Standard Library containers. \ auto_ptr (3c++/3) - A simple, smart pointer class. \ back_insert_iterator (3c++/3) - An insert iterator used to insert items at the end of a collection. \ basic_filebuf (3c++/3) - Class that associates the input or output sequence with a file. \ basic_fstream (3c++/3) - Supports reading and writing of named files or devices associated with a file descriptor. \ basic_ifstream (3c++/3) - Supports reading from named files or other devices associated with a file descriptor. \ basic_ios (3c++/3) - A base class that includes the common functions required by all streams. \ basic_iostream (3c++/3) - Assists in formatting and interpreting sequences of characters controlled by a stream buffer. \ basic_istream (3c++/3) - Assists in reading and interpreting input from sequences controlled by a stream buffer. \ basic_istringstream (3c++/3) - Supports reading objects of class basic_string from an array in memory. \ basic_ofstream (3c++/3) - Supports writing into named files or other devices associated with a file descriptor. \ basic_ostream (3c++/3) - Assists in formatting and writing output to sequences controlled by a stream buffer. \ basic_ostringstream (3c++/3) - Supports writing objects of class basic_string \ basic_streambuf (3c++/3) - Abstract base class for deriving various stream buffers to facilitate control of character sequences. \ basic_string (3c++/3) - A templatized class for handling sequences of character-like entities. string and wstring are specialized versions of basic_string for char's and wchar_t's, respectively. .br typedef basic_string string; .br typedef basic_string wstring; \ basic_stringbuf (3c++/3) - Associates the input or output sequence with a sequence of arbitrary characters. \ basic_stringstream (3c++/3) - Supports writing and reading objects of class basic_string to/from an array in memory. \ binary_function (3c++/3) - Base class for creating binary function objects. \ binary_negate (3c++/3) - A function object that returns the complement of the result of its binary predicate. \ binary_search (3c++/3) - Performs a binary search for a value on a container. \ bind1st (3c++/3) - Templatized utilities to bind values to function objects. \ bitset (3c++/3) - A template class and related functions for storing and manipulating fixed-size sequences of bits. \ cerr (3c++/3) - Controls output to an unbuffered stream buffer associated with the object stderr declared in . \ char_traits (3c++/3) - A traits class with types and operations for the basic_string container and iostream classes. \ cin (3c++/3) - Controls input from a stream buffer associated with the object stdin declared in . \ clog (3c++/3) - Controls output to a stream buffer associated with the object stderr declared in . \ codecvt (3c++/3) - A code conversion facet. \ codecvt_byname (3c++/3) - A facet that includes code set conversion classification facilities based on the named locales. \ collate (3c++/3) - A string collation, comparison, and hashing facet. \ compare (3c++/3) - A binary function or a function object that returns true or false. compare objects are typically passed as template parameters, and used for ordering elements within a container. \ complex (3c++/3) - C++ complex number library \ copy (3c++/3) - Copies a range of elements. \ count (3c++/3) - Count the number of elements in a container that satisfy a given condition. \ cout (3c++/3) - Controls output to a stream buffer associated with the object stdout declared in . \ ctype (3c++/3) - A facet that includes character classification facilities. \ ctype_byname (3c++/3) - A facet that includes character classification facilities based on the named locales. \ deque (3c++/3) - A sequence that supports random access iterators and efficient insertion/deletion at both beginning and end. \ distance (3c++/3) - Computes the distance between two iterators. \ divides (3c++/3) - Returns the result of dividing its first argument by its second. \ equal (3c++/3) - Compares two ranges for equality. \ equal_range (3c++/3) - Find the largest subrange in a collection into which a given value can be inserted without violating the ordering of the collection. \ equal_to (3c++/3) - A binary function object that returns true if its first argument equals its second. \ exception (3c++/3) - A class that supports logic and runtime errors. \ facets (3c++/3) - A family of classes used to encapsulate categories of locale functionality. \ fill (3c++/3) - Initializes a range with a given value. \ find (3c++/3) - Finds an occurrence of value in a sequence. \ find_end (3c++/3) - Finds the last occurrence of a sub-sequence in a sequence. \ find_first_of (3c++/3) - Finds the first occurrence of any value from one sequence in another sequence. \ find_if (3c++/3) - Finds an occurrence of a value in a sequence that satisfies a specified predicate. \ for_each (3c++/3) - Applies a function to each element in a range. \ fpos (3c++/3) - Maintains position information fort he iostream classes. \ front_insert_iterator (3c++/3) - An insert iterator used to insert items at the beginning of a collection. \ generate (3c++/3) - Initialize a container with values produced by a value-generator class. \ get_temporary_buffer (3c++/3) - Pointer based primitive for handling memory \ greater (3c++/3) - A binary function object that returns true if its first argument is greater than its second. \ greater_equal (3c++/3) - A binary function object that returns true if its first argument is greater than or equal to its second \ gslice (3c++/3) - A numeric array class used to represent a generalized slice from an array. \ gslice_array (3c++/3) - A numeric array class used to represent a BLAS-like slice from a valarray. \ has_facet (3c++/3) - A function template used to determine if a locale has a given facet. \ includes (3c++/3) - A basic set of operation for sorted sequences. \ indirect_array (3c++/3) - A numeric array class used to represent elements selected from a valarray. \ inner_product (3c++/3) - Computes the inner product A X B of two ranges A and B. \ inplace_merge (3c++/3) - Merges two sorted sequences into one. \ insert_iterator (3c++/3) - An insert iterator used to insert items into a collection rather than overwrite the collection. \ ios_base (3c++/3) - Defines member types and maintains data for classes that inherit from it. \ iosfwd (3c++/3) - The header iosfwd forward declares the input/output library template classes and specializes them for wide and tiny characters. It also defines the positional types used in class char_traits instantiated on tiny and wide characters. \ isalnum (3c++/3) - Determines if a character is alphabetic or numeric. \ isalpha (3c++/3) - Determines if a character is alphabetic. \ iscntrl (3c++/3) - Determines if a character is a control character. \ isdigit (3c++/3) - Determines if a character is a decimal digit. \ isgraph (3c++/3) - Determines if a character is a graphic character. \ islower (3c++/3) - Determines whether a character is lower case. \ isprint (3c++/3) - Determines if a character is printable. \ ispunct (3c++/3) - Determines if a character is punctuation. \ isspace (3c++/3) - Determines if a character is a space. \ istream_iterator (3c++/3) - A stream iterator that has iterator capabilities for istreams. This iterator allows generic algorithms to be used directly on streams. \ istreambuf_iterator (3c++/3) - Reads successive characters from the stream buffer for which it was constructed. \ istrstream (3c++/3) - Reads characters from an array in memory. \ isupper (3c++/3) - Determines whether a character is upper case. \ isxdigit (3c++/3) - Determines whether a character is a hexadecimal digit. \ iter_swap (3c++/3) - Exchanges values in two locations. \ iterator (3c++/3) - A base iterator class. \ iterator_traits (3c++/3) - Returns basic information about an iterator. \ less (3c++/3) - A binary function object that returns true if its first argument is less than its second. \ less_equal (3c++/3) - A binary function object that returns true if its first argument is less than or equal to its second. \ lexicographical_compare (3c++/3) - Compares two ranges lexicographically. \ list (3c++/3) - A sequence that supports bidirectional iterators. \ locale (3c++/3) - A localization class containing a polymorphic set of facets. \ logical_and (3c++/3) - A binary function object that returns true if both of its arguments are true. \ logical_not (3c++/3) - A unary function object that returns true if its argument is false. \ logical_or (3c++/3) - A binary function object that returns true if either of its arguments are true. \ lower_bound (3c++/3) - Determine the first valid position for an element in a sorted container. \ make_heap (3c++/3) - Creates a heap. \ map (3c++/3) - An associative container with access to non-key values using unique keys. A map supports bidirectional iterators. \ mask_array (3c++/3) - A numeric array class that gives a masked view of a valarray. \ max (3c++/3) - Finds and returns the maximum of a pair of values. \ max_element (3c++/3) - Finds the maximum value in a range. \ mem_fun (3c++/3) - Function objects that adapt a pointer to a member function, to take the place of a global function. \ merge (3c++/3) - Merges two sorted sequences into a third sequence. \ messages (3c++/3) - Messaging facets. \ min (3c++/3) - Finds and returns the minimum of a pair of values. \ min_element (3c++/3) - Finds the minimum value in a range. \ minus (3c++/3) - Returns the result of subtracting its second argument from its first. \ mismatch (3c++/3) - Compares elements from two sequences and returns the first two elements that don't match each other. \ modulus (3c++/3) - Returns the remainder obtained by dividing the first argument by the second argument. \ money_get (3c++/3) - Monetary formatting facet for input. \ money_put (3c++/3) - Monetary formatting facet for output. \ moneypunct (3c++/3) - Monetary punctuation facets. \ multimap (3c++/3) - An associative container that gives access to non-key values using keys. multimap keys are not required to be unique. A multimap supports bidirectional iterators. \ multiplies (3c++/3) - A binary function object that returns the result of multiplying its first and second arguments. \ multiset (3c++/3) - An associative container that allows fast access to stored key values. Storage of duplicate keys is allowed. A multiset supports bidirectional iterators. \ negate (3c++/3) - Unary function object that returns the negation of its argument. \ next_permutation (3c++/3) - Generates successive permutations of a sequence based on an ordering function. \ not1 (3c++/3) - A function adaptor used to reverse the sense of a unary predicate function object. \ not2 (3c++/3) - A function adaptor used to reverse the sense of a binary predicate function object. \ not_equal_to (3c++/3) - A binary function object that returns true if its first argument is not equal to its second. \ nth_element (3c++/3) - Rearranges a collection so that all elements lower in sorted order than the nth element come before it and all elements higher in sorter order than the nth element come after it. \ num_get (3c++/3) - A numeric formatting facet for input. \ num_put (3c++/3) - A numeric formatting facet for output. \ numeric_limits (3c++/3) - A class for representing information about scalar types. \ numpunct (3c++/3) - A numeric punctuation facet. \ ostream_iterator (3c++/3) - Stream iterators allow for use of iterators with ostreams and istreams. They allow generic algorithms to be used directly on streams. \ ostreambuf_iterator (3c++/3) - Writes successive characters onto the stream buffer object from which it was constructed. \ ostrstream (3c++/3) - Writes to an array in memory. \ pair (3c++/3) - A template for heterogeneous pairs of values. \ partial_sort (3c++/3) - Templatized algorithm for sorting collections of entities. \ partial_sort_copy (3c++/3) - Templatized algorithm for sorting collections of entities. \ partial_sum (3c++/3) - Calculates successive partial sums of a range of values. \ partition (3c++/3) - Places all of the entities that satisfy the given predicate before all of the entities that do not. \ permutation (3c++/3) - Generates successive permutations of a sequence based on an ordering function. See the entries for next_permutation and prev-_permutation. \ plus (3c++/3) - A binary function object that returns the result of adding its first and second arguments. \ pointer_to_binary_function (3c++/3) - A function object that adapts a pointer to a binary function, to take the place of a binary_function. \ pointer_to_unary_function (3c++/3) - A function object class that adapts a pointer to a function, to take the place of a unary_function. \ pop_heap (3c++/3) - Moves the largest element off the heap. \ prev_permutation (3c++/3) - Generates successive permutations of a sequence based on an ordering function. \ priority_queue (3c++/3) - A container adapter that behaves like a priority queue. Items popped from the queue are in order with respect to a "priority." \ ptr_fun (3c++/3) - A function that is overloaded to adapt a pointer to a function, to take the place of a function. \ push_heap (3c++/3) - Places a new element into a heap. \ queue (3c++/3) - A container adaptor that behaves like a queue (first in, first out). \ random_shuffle (3c++/3) - Randomly shuffles elements of a collection. \ raw_storage_iterator (3c++/3) - Enables iterator-based algorithms to store results into uninitialized memory. \ remove (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. \ remove_copy (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. \ remove_copy_if (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. \ remove_if (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. \ replace (3c++/3) - Substitutes elements in a collection with new values. \ replace_copy (3c++/3) - Substitutes elements in a collection with new values, and moves the revised sequence into result. \ replace_copy_if (3c++/3) - Substitutes elements in a collection with new values, and moves the revised sequence into result. \ replace_if (3c++/3) - Substitutes elements in a collection with new values. \ return_temporary_buffer (3c++/3) - A pointer-based primitive for handling memory. .RE .RS 0 #include .br template .br void return_temporary_buffer (T* p, T*); \ reverse (3c++/3) - Reverses the order of elements in a collection. \ reverse_copy (3c++/3) - Reverses the order of elements in a collection while copying them to a new collection. \ rotate (3c++/3) - Swaps the segment that contains elements from first through middle-1 with the segment that contains the elements from middle through last. \ search (3c++/3) - Finds a sub-sequence within a sequence of values that is element-wise equal to the values in an indicated range. \ set (3c++/3) - An associative container that supports unique keys. A set supports bidirectional iterators. \ set_difference (3c++/3) - A basic set operation for constructing a sorted difference. \ set_intersection (3c++/3) - A basic set operation for constructing a sorted intersection. \ set_symmetric_difference (3c++/3) - A basic set operation for constructing a sorted symmetric difference. \ set_union (3c++/3) - A basic set operation for constructing a sorted union. \ slice (3c++/3) - A numeric array class for representing a BLAS-like slice from an array. \ slice_array (3c++/3) - A numeric array class for representing a BLAS-like slice from a valarray. \ smanip (3c++/3) - Helper classes used to implement parameterized manipulators. \ sort (3c++/3) - A templatized algorithm for sorting collections of entities. \ sort_heap (3c++/3) - Converts a heap into a sorted collection. \ stable_partition (3c++/3) - Places all of the entities that satisfy the given predicate before all of the entities that do not, while maintaining the relative order of elements in each group. \ stable_sort (3c++/3) - A templatized algorithm for sorting collections of entities. \ stack (3c++/3) - A container adapter that behaves like a stack (last in, first out). \ string (3c++/3) - A typedef for: basic_string, allocator> For more information about strings, see the entry basic_string. \ strstream (3c++/3) - Reads and writes to an array in memory. \ strstreambuf (3c++/3) - Associates either the input sequence or the output sequence with a tiny character array whose elements store arbitrary values. \ swap (3c++/3) - Exchanges values. \ swap_ranges (3c++/3) - Exchanges a range of values in one location with those in another. \ time_get (3c++/3) - A time formatting facet for input. \ time_get_byname (3c++/3) - A time formatting facet for input, based on the named locales. \ time_put (3c++/3) - A time formatting facet for output. \ time_put_byname (3c++/3) - A facet that includes formatted time output facilities based on the named locales. \ tolower (3c++/3) - Converts a character to lower case. \ toupper (3c++/3) - Converts a character to upper case. \ transform (3c++/3) - Applies an operation to a range of values in a collection and stores the result. \ unary_function (3c++/3) - A base class for creating unary function objects. \ unary_negate (3c++/3) - A function object that returns the complement of the result of its unary predicate \ uninitialized_copy (3c++/3) - An algorithm that uses construct to copy values from one range to another location. \ uninitialized_fill (3c++/3) - An algorithm that uses the construct algorithm for setting values in a collection. \ uninitialized_fill_n (3c++/3) - An algorithm that uses the construct algorithm for setting values in a collection. \ unique (3c++/3) - Removes consecutive duplicates from a range of values and places the resulting unique values into the result. \ upper_bound (3c++/3) - Determines the last valid position for a value in a sorted container. \ use_facet (3c++/3) - A template function used to obtain a facet. \ valarray (3c++/3) - An optimized array class for numeric operations. \ vector (3c++/3) - A sequence that supports random access iterators. \ wcerr (3c++/3) - Controls output to an unbuffered stream buffer associated with the object stderr declared in . \ wcin (3c++/3) - Controls input from a stream buffer associated with the object stdin declared in . \ wclog (3c++/3) - Controls output to a stream buffer associated with the object stderr declared in . \ wcout (3c++/3) - Controls output to a stream buffer associated with the object stdout declared in . \ wstring (3c++/3) - A typedef for: .br .br basic_string, .br allocator > For more information about strings, see the entry basic_string. __distance_type __distance_type (3c++/3) - Determines the type of distance used by an iterator. This function is now obsolete. It is retained in order to include backward compatibility and support compilers that do not include partial specialization. __iterator_category __iterator_category (3c++/3) - Determines the category to which an iterator belongs. This function is now obsolete. It is included for backward compatibility and to support compilers that do not include partial specialization. __reverse_bi_iterator __reverse_bi_iterator (3c++/3) - An iterator that traverses a collection backwards. __reverse_bi_iterator is included for those compilers that do not support partial specialization. The template signature for reverse_iterator matches that of __reverse_bi_iterator when partial specialization is not available (in other words, it has six template parameters rather than one). _rtc_check_free _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_check_malloc _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_check_malloc_result _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_check_realloc _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_check_realloc_result _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_hide_region _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_off _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_on _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_record_free _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_record_malloc _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_record_realloc _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. _rtc_report_error _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. abort abort (3f) - terminate abruptly; write memory image to core file acc acc (1) - C compiler access access (3f) - return access mode (r,w,x) or existence of a file access_control access_control (4) - TeamWare access control file accumulate accumulate (3c++/3) - Accumulates all elements within a range into a single value. acosd trig_sun (3m) - more trigonometric functions acosp trig_sun (3m) - more trigonometric functions acospi trig_sun (3m) - more trigonometric functions addrans addrans (3m) - additive pseudo-random number generators adjacent_difference adjacent_difference (3c++/3) - Outputs a sequence of the differences between each adjacent pair of elements in a range. adjacent_find adjacent_find (3c++/3) - Find the first adjacent pair of elements in a sequence that are equivalent. advance advance (3c++/3) - Moves an iterator forward or backward (if available) by a certain distance. aint aint (3m) - round to integral value in floating-point or integer format alarm alarm (3f) - execute a subroutine after a specified time allocator allocator (3c++/3) - The default allocator object for storage management in Standard Library containers. analyzer analyzer (1) - Motif interface for analyzing an experiment that is generated by using the Sampling Collector from the Sun WorkShop Debugging window. anint aint (3m) - round to integral value in floating-point or integer format annuity exp2 (3m) - exponential, logarithm, financial args args (4) - TeamWare argument caching file asind trig_sun (3m) - more trigonometric functions asinp trig_sun (3m) - more trigonometric functions asinpi trig_sun (3m) - more trigonometric functions atan2d trig_sun (3m) - more trigonometric functions atan2pi trig_sun (3m) - more trigonometric functions atand trig_sun (3m) - more trigonometric functions atanp trig_sun (3m) - more trigonometric functions atanpi trig_sun (3m) - more trigonometric functions auto_ptr auto_ptr (3c++/3) - A simple, smart pointer class. available_threads available_threads (3p) - returns information about current thread usage .HP 1i SUBROUTINE AVAILABLE_THREADS (NTOTAL, NUSING) .HP 1i INTEGER NTOTAL .HP 1i INTEGER NUSING .HP 1i .HP 1i #include .HP 1i void available_threads (int *total, int *now_using); back_insert_iterator back_insert_iterator (3c++/3) - An insert iterator used to insert items at the end of a collection. back_inserter back_insert_iterator (3c++/3) - An insert iterator used to insert items at the end of a collection. basic_filebuf basic_filebuf (3c++/3) - Class that associates the input or output sequence with a file. basic_fstream basic_fstream (3c++/3) - Supports reading and writing of named files or devices associated with a file descriptor. basic_ifstream basic_ifstream (3c++/3) - Supports reading from named files or other devices associated with a file descriptor. basic_ios basic_ios (3c++/3) - A base class that includes the common functions required by all streams. basic_iostream basic_iostream (3c++/3) - Assists in formatting and interpreting sequences of characters controlled by a stream buffer. basic_istream basic_istream (3c++/3) - Assists in reading and interpreting input from sequences controlled by a stream buffer. basic_istringstream basic_istringstream (3c++/3) - Supports reading objects of class basic_string from an array in memory. basic_ofstream basic_ofstream (3c++/3) - Supports writing into named files or other devices associated with a file descriptor. basic_ostream basic_ostream (3c++/3) - Assists in formatting and writing output to sequences controlled by a stream buffer. basic_ostringstream basic_ostringstream (3c++/3) - Supports writing objects of class basic_string basic_streambuf basic_streambuf (3c++/3) - Abstract base class for deriving various stream buffers to facilitate control of character sequences. basic_string basic_string (3c++/3) - A templatized class for handling sequences of character-like entities. string and wstring are specialized versions of basic_string for char's and wchar_t's, respectively. .br typedef basic_string string; .br typedef basic_string wstring; basic_stringbuf basic_stringbuf (3c++/3) - Associates the input or output sequence with a sequence of arbitrary characters. basic_stringstream basic_stringstream (3c++/3) - Supports writing and reading objects of class basic_string to/from an array in memory. bcheck bcheck (1) - batch utility for Runtime Checking (RTC) bil2xd bil2xd (1) - Converts BIL source to WorkShop Visual save files binary_function binary_function (3c++/3) - Base class for creating binary function objects. binary_negate binary_negate (3c++/3) - A function object that returns the complement of the result of its binary predicate. binary_search binary_search (3c++/3) - Performs a binary search for a value on a container. bind1st bind1st (3c++/3) - Templatized utilities to bind values to function objects. bind2nd bind1st (3c++/3) - Templatized utilities to bind values to function objects. binder1st bind1st (3c++/3) - Templatized utilities to bind values to function objects. binder2nd bind1st (3c++/3) - Templatized utilities to bind values to function objects. bit bit (3f) - and, or, xor, not, rshift, lshift, bic, bis, bit, setbit functions bitset bitset (3c++/3) - A template class and related functions for storing and manipulating fixed-size sequences of bits. bringover bringover (1) - copy files from a parent workspace to a child workspace c++filt c++filt (1) - c++ name demangler c89 c89 (1) - compile standard C programs cartpol cartpol (3) - cartesian/polar functions in the C++ complex number math library caxpy caxpy (3p) - Compute y := alpha * x + y cb cb (1) - C program beautifier cbdsqr cbdsqr (3p) - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B cc cc (1) - C compiler cchdc cchdc (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. cchdd cchdd (3p) - downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. cchex cchex (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. cchud cchud (3p) - update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. ccnvcor ccnvcor (3p) - compute the convolution or correlation of complex vectors .HP 1i SUBROUTINE CCNVCOR (CNVCOR, FOUR, NX, X, IFX, INCX, NY, NPRE, M, Y, IFY, INC1Y, INC2Y, NZ, K, Z, IFZ, INC1Z, INC2Z, WORK, LWORK) .HP 1i CHARACTER CNVCOR, FOUR .HP 1i INTEGER IFX, IFY, IFZ, INCX, INC1Y, INC2Y, INC1Z, INC2Z, K, LWORK, NPRE, NX, NY, M, NZ .HP 1i COMPLEX X(*), Y(*), Z(*) .HP 1i COMPLEX WORK(*) .HP 1i .HP 1i .HP 1i #include .HP 1i void ccnvcor(char cnvcor, char four, int nx, complex *x, int ifx, int incx, int ny, int npre, int m, complex *y, int ify, int inc1y, int inc2y, int nz, int k, complex *z, int ifz, int inc1z, int inc2z, complex *work, int lwork); ccnvcor2 ccnvcor2 (3p) - compute the convolution or correlation of complex matrices .HP 1i SUBROUTINE CCNVCOR2 (CNVCOR, METHOD, TRANSX, SCRATCHX, TRANSY, SCRATCHY, MX, NX, X, LDX, MY, NY, MPRE, NPRE, Y, LDY, MZ, NZ, Z, LDZ, WORK, LWORK) .HP 1i CHARACTER CNVCOR, METHOD, SCRATCHX, SCRATCHY, TRANSX, TRANSY .HP 1i INTEGER LDX, LDY, LDZ, LWORK, MPRE, MX, MY, MZ, NPRE, NX, NY, NZ .HP 1i COMPLEX X(*), Y(*), Z(*) .HP 1i COMPLEX WORK(*) .HP 1i .HP 1i #include .HP 1i void ccnvcor2 (char cnvcor, char method, char transx, char scratchx, char transy, char scratchy, int mx, int nx, complex *x, int ldx, int my, int ny, int mpre, int npre, complex *y, int ldy, int mz, int nz, complex *z, int ldz, complex *workin, int lwork); ccopy ccopy (3p) - Copy x to y cdotc cdotc (3p) - Compute the dot product of two vectors x and conjg(y). cdotu cdotu (3p) - Compute the dot product of two vectors x and y. cerr cerr (3c++/3) - Controls output to an unbuffered stream buffer associated with the object stderr declared in . cfft2b cfft2b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. cfft2f cfft2f (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. cfft2i cfft2i (3p) - initialize the array xWSAVE, which is used in both xFFT2F and xFFT2B. cfft3b cfft3b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. cfft3f cfft3f (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. cfft3i cfft3i (3p) - initialize the array xWSAVE, which is used in both xFFT3F and xFFT3B. cfftb cfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. cfftf cfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. cffti cffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. cfftopt cfftopt (3p) - compute the length of the closest fast FFT .HP 1i INTEGER FUNCTION CFFTOPT(N) .HP 1i INTEGER N .HP 1i .HP 1i #include .HP 1i int cfftopt(int len); cflow cflow (1) - generate C flowgraph cgbbrd cgbbrd (3p) - reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation cgbco cgbco (3p) - compute the LU factorization and condition number of a general matrix A in banded storage. If the condition number is not needed then xGBFA is slightly faster. It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. cgbcon cgbcon (3p) - estimate the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm. cgbdi cgbdi (3p) - compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA. cgbequ cgbequ (3p) - compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number cgbfa cgbfa (3p) - compute the LU factorization of a matrix A in banded storage. It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. cgbmv cgbmv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or y := alpha*conjg( A' )*x + beta*y cgbrfs cgbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution cgbsl cgbsl (3p) - solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x. cgbsv cgbsv (3p) - compute the solution to a complex system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices cgbsvx cgbsvx (3p) - use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B, cgbtf2 cgbtf2 (3p) - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges cgbtrf cgbtrf (3p) - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges cgbtrs cgbtrs (3p) - solve a system of linear equations A * X = B, A**T * X = B, or A**H * X = B with a general band matrix A using the LU factorization computed by CGBTRF cgebak cgebak (3p) - form the right or left eigenvectors of a complex general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by CGEBAL cgebal cgebal (3p) - balance a general complex matrix A cgebd2 cgebd2 (3p) - reduce a complex general m by n matrix A to upper or lower real bidiagonal form B by a unitary transformation cgebrd cgebrd (3p) - reduce a general complex M-by-N matrix A to upper or lower bidiagonal form B by a unitary transformation cgeco cgeco (3p) - compute the LU factorization and estimate the condition number of a general matrix A. If the condition number is not needed then xGEFA is slightly faster. It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A. cgecon cgecon (3p) - estimate the reciprocal of the condition number of a general complex matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by CGETRF cgedi cgedi (3p) - compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA. cgeequ cgeequ (3p) - compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number cgees cgees (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z cgeesx cgeesx (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z cgeev cgeev (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors cgeevx cgeevx (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors cgefa cgefa (3p) - compute the LU factorization of a general matrix A. It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A. cgegs cgegs (3p) - compute for a pair of N-by-N complex nonsymmetric matrices A, cgegv cgegv (3p) - compute for a pair of N-by-N complex nonsymmetric matrices A and B, the generalized eigenvalues (alpha, beta), and optionally, cgehd2 cgehd2 (3p) - reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation cgehrd cgehrd (3p) - reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation cgelq2 cgelq2 (3p) - compute an LQ factorization of a complex m by n matrix A cgelqf cgelqf (3p) - compute an LQ factorization of a complex M-by-N matrix A cgels cgels (3p) - solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix A, or its conjugate-transpose, using a QR or LQ factorization of A cgelss cgelss (3p) - compute the minimum norm solution to a complex linear least squares problem cgelsx cgelsx (3p) - compute the minimum-norm solution to a complex linear least squares problem cgemm cgemm (3p) - perform one of the matrix-matrix operations C := alpha*op( A )*op( B ) + beta*C cgemv cgemv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or y := alpha*conjg( A' )*x + beta*y cgeql2 cgeql2 (3p) - compute a QL factorization of a complex m by n matrix A cgeqlf cgeqlf (3p) - compute a QL factorization of a complex M-by-N matrix A cgeqpf cgeqpf (3p) - compute a QR factorization with column pivoting of a complex M-by-N matrix A cgeqr2 cgeqr2 (3p) - compute a QR factorization of a complex m by n matrix A cgeqrf cgeqrf (3p) - compute a QR factorization of a complex M-by-N matrix A cgerc cgerc (3p) - perform the rank 1 operation A := alpha*x*conjg( y' ) + A cgerfs cgerfs (3p) - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution cgerq2 cgerq2 (3p) - compute an RQ factorization of a complex m by n matrix A cgerqf cgerqf (3p) - compute an RQ factorization of a complex M-by-N matrix A cgeru cgeru (3p) - perform the rank 1 operation A := alpha*x*y' + A cgesl cgesl (3p) - solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x. cgesv cgesv (3p) - compute the solution to a complex system of linear equations A * X = B, cgesvd cgesvd (3p) - compute the singular value decomposition (SVD) of a complex M-by-N matrix A, optionally computing the left and/or right singular vectors cgesvx cgesvx (3p) - use the LU factorization to compute the solution to a complex system of linear equations A * X = B, cgetf2 cgetf2 (3p) - compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges cgetrf cgetrf (3p) - compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges cgetri cgetri (3p) - compute the inverse of a matrix using the LU factorization computed by CGETRF cgetrs cgetrs (3p) - solve a system of linear equations A * X = B, A**T * X = B, or A**H * X = B with a general N-by-N matrix A using the LU factorization computed by CGETRF cggbak cggbak (3p) - form the right or left eigenvectors of a complex generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by CGGBAL cggbal cggbal (3p) - balance a pair of general complex matrices (A,B) cggglm cggglm (3p) - solve a general Gauss-Markov linear model (GLM) problem cgghrd cgghrd (3p) - reduce a pair of complex matrices (A,B) to generalized upper Hessenberg form using unitary transformations, where A is a general matrix and B is upper triangular cgglse cgglse (3p) - solve the linear equality-constrained least squares (LSE) problem cggqrf cggqrf (3p) - compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B cggrqf cggrqf (3p) - compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B cggsvd cggsvd (3p) - compute the generalized singular value decomposition (GSVD) of an M-by-N complex matrix A and P-by-N complex matrix B cggsvp cggsvp (3p) - compute unitary matrices U, V and Q such that N-K-L K L U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0 cgtcon cgtcon (3p) - estimate the reciprocal of the condition number of a complex tridiagonal matrix A using the LU factorization as computed by CGTTRF cgtrfs cgtrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution cgtsl cgtsl (3p) - solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x. cgtsv cgtsv (3p) - solve the equation A*X = B, cgtsvx cgtsvx (3p) - use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B, cgttrf cgttrf (3p) - compute an LU factorization of a complex tridiagonal matrix A using elimination with partial pivoting and row interchanges cgttrs cgttrs (3p) - solve one of the systems of equations A * X = B, A**T * X = B, or A**H * X = B, char_traits char_traits (3c++/3) - A traits class with types and operations for the basic_string container and iostream classes. chbev chbev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A chbevd chbevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A chbevx chbevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A chbgst chbgst (3p) - reduce a complex Hermitian-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, chbgv chbgv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x chbmv chbmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y chbtrd chbtrd (3p) - reduce a complex Hermitian band matrix A to real symmetric tridiagonal form T by a unitary similarity transformation chdir chdir (3f) - change default directory checon checon (3p) - estimate the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF cheev cheev (3p) - compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A cheevd cheevd (3p) - compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A cheevx cheevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A chegs2 chegs2 (3p) - reduce a complex Hermitian-definite generalized eigenproblem to standard form chegst chegst (3p) - reduce a complex Hermitian-definite generalized eigenproblem to standard form chegv chegv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x chemm chemm (3p) - perform one of the matrix-matrix operations C := alpha*A*B + beta*C or C := alpha*B*A + beta*C chemv chemv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y cher cher (3p) - perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A cher2 cher2 (3p) - perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A cher2k cher2k (3p) - perform one of the Hermitian rank 2k operations C := alpha*A*conjg( B' ) + conjg( alpha )*B*conjg( A' ) + beta*C or C := alpha*conjg( A' )*B + conjg( alpha )*conjg( B' )*A + beta*C cherfs cherfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates for the solution cherk cherk (3p) - perform one of the Hermitian rank k operations C := alpha*A*conjg( A' ) + beta*C or C := alpha*conjg( A' )*A + beta*C chesv chesv (3p) - compute the solution to a complex system of linear equations A * X = B, chesvx chesvx (3p) - use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B, chetd2 chetd2 (3p) - reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation chetf2 chetf2 (3p) - compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method chetrd chetrd (3p) - reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation chetrf chetrf (3p) - compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method chetri chetri (3p) - compute the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF chetrs chetrs (3p) - solve a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF chgeqz chgeqz (3p) - implement a single-shift version of the QZ method for finding the generalized eigenvalues w(i)=ALPHA(i)/BETA(i) of the equation det( A-w(i) B ) = 0 If JOB='S', then the pair (A,B) is simultaneously reduced to Schur form (i.e., A and B are both upper triangular) by applying one unitary tranformation (usually called Q) on the left and another (usually called Z) on the right chico chico (3p) - compute the UDU factorization and condition number of a Hermitian matrix A. If the condition number is not needed then xHIFA is slightly faster. It is typical to follow a call to xHICO with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A. chidi chidi (3p) - compute the determinant, inertia, and inverse of a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA. chifa chifa (3p) - compute the UDU factorization of a Hermitian matrix A. It is typical to follow a call to xHIFA with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A. children children (4) - List of a workspace's child workspaces chisl chisl (3p) - solve the linear system Ax = b for a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA, and vectors b and x. chmod chmod (3f) - change mode of a file chpco chpco (3p) - compute the UDU factorization and condition number of a Hermitian matrix A in packed storage. If the condition number is not needed then xHPFA is slightly faster. It is typical to follow a call to xHPCO with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A. chpcon chpcon (3p) - estimate the reciprocal of the condition number of a complex Hermitian packed matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF chpdi chpdi (3p) - compute the determinant, inertia, and inverse of a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA. chpev chpev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage chpevd chpevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage chpevx chpevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage chpfa chpfa (3p) - compute the UDU factorization of a Hermitian matrix A in packed storage. It is typical to follow a call to xHPFA with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A. chpgst chpgst (3p) - reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage chpgv chpgv (3p) - compute all the eigenvalues and, optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x chpmv chpmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y chpr chpr (3p) - perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A chpr2 chpr2 (3p) - perform the Hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A chprfs chprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite and packed, and provides error bounds and backward error estimates for the solution chpsl chpsl (3p) - solve the linear system Ax = b for a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA, and vectors b and x. chpsv chpsv (3p) - compute the solution to a complex system of linear equations A * X = B, chpsvx chpsvx (3p) - use the diagonal pivoting factorization A = U*D*U**H or A = L*D*L**H to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian matrix stored in packed format and X and B are N-by-NRHS matrices chptrd chptrd (3p) - reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation chptrf chptrf (3p) - compute the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method chptri chptri (3p) - compute the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF chptrs chptrs (3p) - solve a system of linear equations A*X = B with a complex Hermitian matrix A stored in packed format using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF chsein chsein (3p) - use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H chseqr chseqr (3p) - compute the eigenvalues of a complex upper Hessenberg matrix H, and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**H, where T is an upper triangular matrix (the Schur form), and Z is the unitary matrix of Schur vectors cin cin (3c++/3) - Controls input from a stream buffer associated with the object stdin declared in . clabrd clabrd (3p) - reduce the first NB rows and columns of a complex general m by n matrix A to upper or lower real bidiagonal form by a unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A clacgv clacgv (3p) - conjugate a complex vector of length N clacon clacon (3p) - estimate the 1-norm of a square, complex matrix A clacpy clacpy (3p) - copie all or part of a two-dimensional matrix A to another matrix B clacrm clacrm (3p) - perform a very simple matrix-matrix multiplication clacrt clacrt (3p) - apply a plane rotation, where the cos and sin (C and S) are complex and the vectors CX and CY are complex cladiv cladiv (3p) - := X / Y, where X and Y are complex claed0 claed0 (3p) - the divide and conquer method, CLAED0 computes all eigenvalues of a symmetric tridiagonal matrix which is one diagonal block of those from reducing a dense or band Hermitian matrix and corresponding eigenvectors of the dense or band matrix claed7 claed7 (3p) - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix claed8 claed8 (3p) - merge the two sets of eigenvalues together into a single sorted set claein claein (3p) - use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H claesy claesy (3p) - compute the eigendecomposition of a 2-by-2 symmetric matrix ( ( A, B );( B, C ) ) provided the norm of the matrix of eigenvectors is larger than some threshold value claev2 claev2 (3p) - compute the eigendecomposition of a 2-by-2 Hermitian matrix [ A B ] [ CONJG(B) C ] clags2 clags2 (3p) - compute 2-by-2 unitary matrices U, V and Q, such that if ( UPPER ) then U'*A*Q = U'*( A1 A2 )*Q = ( x 0 ) ( 0 A3 ) ( x x ) and V'*B*Q = V'*( B1 B2 )*Q = ( x 0 ) ( 0 B3 ) ( x x ) or if ( .NOT.UPPER ) then U'*A*Q = U'*( A1 0 )*Q = ( x x ) ( A2 A3 ) ( 0 x ) and V'*B*Q = V'*( B1 0 )*Q = ( x x ) ( B2 B3 ) ( 0 x ) where U = ( CSU SNU ), V = ( CSV SNV ), clagtm clagtm (3p) - perform a matrix-vector product of the form B := alpha * A * X + beta * B where A is a tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta are real scalars, each of which may be zero, one, or minus one clahef clahef (3p) - compute a partial factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method clahqr clahqr (3p) - i an auxiliary routine called by CHSEQR to update the eigenvalues and Schur decomposition already computed by CHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI clahrd clahrd (3p) - reduce the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero claic1 claic1 (3p) - apply one step of incremental condition estimation in its simplest version clangb clangb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals clange clange (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex matrix A clangt clangt (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex tridiagonal matrix A clanhb clanhb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n hermitian band matrix A, with k super-diagonals clanhe clanhe (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A clanhp clanhp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A, supplied in packed form clanhs clanhs (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A clanht clanht (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex Hermitian tridiagonal matrix A clansb clansb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals clansp clansp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A, supplied in packed form clansy clansy (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A clantb clantb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals clantp clantp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form clantr clantr (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A clapll clapll (3p) - two column vectors X and Y, let A = ( X Y ) clapmt clapmt (3p) - rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N claqgb claqgb (3p) - equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C claqge claqge (3p) - equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C claqhb claqhb (3p) - equilibrate a symmetric band matrix A using the scaling factors in the vector S claqhe claqhe (3p) - equilibrate a Hermitian matrix A using the scaling factors in the vector S claqhp claqhp (3p) - equilibrate a Hermitian matrix A using the scaling factors in the vector S claqsb claqsb (3p) - equilibrate a symmetric band matrix A using the scaling factors in the vector S claqsp claqsp (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S claqsy claqsy (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S clar2v clar2v (3p) - apply a vector of complex plane rotations with real cosines from both sides to a sequence of 2-by-2 complex Hermitian matrices, clarf clarf (3p) - apply a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right clarfb clarfb (3p) - apply a complex block reflector H or its transpose H' to a complex M-by-N matrix C, from either the left or the right clarfg clarfg (3p) - generate a complex elementary reflector H of order n, such that H' * ( alpha ) = ( beta ), H' * H = I clarft clarft (3p) - form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors clarfx clarfx (3p) - apply a complex elementary reflector H to a complex m by n matrix C, from either the left or the right clargv clargv (3p) - generate a vector of complex plane rotations with real cosines, determined by elements of the complex vectors x and y clarnv clarnv (3p) - return a vector of n random complex numbers from a uniform or normal distribution clartg clartg (3p) - generate a plane rotation so that [ CS SN ] [ F ] [ R ] [ __ ] clartv clartv (3p) - apply a vector of complex plane rotations with real cosines to elements of the complex vectors x and y clascl clascl (3p) - multiply the M by N complex matrix A by the real scalar CTO/CFROM claset claset (3p) - initialize a 2-D array A to BETA on the diagonal and ALPHA on the offdiagonals clasr clasr (3p) - perform the transformation A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) where A is an m by n complex matrix and P is an orthogonal matrix, classq classq (3p) - return the values scl and ssq such that ( scl**2 )*ssq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, claswp claswp (3p) - perform a series of row interchanges on the matrix A clasyf clasyf (3p) - compute a partial factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method clatbs clatbs (3p) - solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b, clatps clatps (3p) - solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b, clatrd clatrd (3p) - reduce NB rows and columns of a complex Hermitian matrix A to Hermitian tridiagonal form by a unitary similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A clatrs clatrs (3p) - solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b, clatzm clatzm (3p) - apply a Householder matrix generated by CTZRQF to a matrix clauu2 clauu2 (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A clauum clauum (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A clibmvec clibmvec (3m) - vector versions of some complex mathematical functions clog clog (3c++/3) - Controls output to a stream buffer associated with the object stderr declared in . codecvt codecvt (3c++/3) - A code conversion facet. codecvt_byname codecvt_byname (3c++/3) - A facet that includes code set conversion classification facilities based on the named locales. codemgr codemgr (1) - The TeamWare "umbrella" command. codemgrtool teamware (1) - teamware is a graphical user interface (GUI) tool for CodeManager commands. collate collate (3c++/3) - A string collation, comparison, and hashing facet. collate_byname collate (3c++/3) - A string collation, comparison, and hashing facet. compare compare (3c++/3) - A binary function or a function object that returns true or false. compare objects are typically passed as template parameters, and used for ordering elements within a container. complex complex (3c++/3) - C++ complex number library complex cplx.intro (3) - introduction to C++ complex number math library complex cplxerr (3) - error-handling functions in the C++ complex number math library compound exp2 (3m) - exponential, logarithm, financial conflicts conflicts (4) - List of files in conflict in a workspace convert_external convert_external (3m) - convert external binary data formats coptimal_workspace coptimal_workspace (3p) - Get the optimal amount of workspace for the last routine called that supports varying length complex workspace. copy copy (3c++/3) - Copies a range of elements. copy_backward copy (3c++/3) - Copies a range of elements. cosd trig_sun (3m) - more trigonometric functions cosp trig_sun (3m) - more trigonometric functions cospi trig_sun (3m) - more trigonometric functions cosqb cosqb (3p) - synthesize a Fourier sequence from its representation in terms of a cosine series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. cosqf cosqf (3p) - compute the Fourier coefficients in a cosine series representation with only odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. cosqi cosqi (3p) - initialize the array xWSAVE, which is used in both xCOSQF and xCOSQB. cost cost (3p) - compute the discrete Fourier cosine transform of an even sequence. The xCOST transforms are unnormalized inverses of themselves, so a call of xCOST followed by another call of xCOST will multiply the input sequence by 2 * (N-1). The VxCOST transforms are normalized, so a call of VxCOST followed by a call of VxCOST will return the original sequence. costi costi (3p) - initialize the array xWSAVE, which is used in xCOST. count count (3c++/3) - Count the number of elements in a container that satisfy a given condition. count_if count (3c++/3) - Count the number of elements in a container that satisfy a given condition. cout cout (3c++/3) - Controls output to a stream buffer associated with the object stdout declared in . cpbco cpbco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage. If the condition number is not needed then xPBFA is slightly faster. It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. cpbcon cpbcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite band matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPBTRF cpbdi cpbdi (3p) - compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA. cpbequ cpbequ (3p) - compute row and column scalings intended to equilibrate a Hermitian positive definite band matrix A and reduce its condition number (with respect to the two-norm) cpbfa cpbfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage. It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. cpbrfs cpbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and banded, and provides error bounds and backward error estimates for the solution cpbsl cpbsl (3p) - section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x. cpbstf cpbstf (3p) - compute a split Cholesky factorization of a complex Hermitian positive definite band matrix A cpbsv cpbsv (3p) - compute the solution to a complex system of linear equations A * X = B, cpbsvx cpbsvx (3p) - use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B, cpbtf2 cpbtf2 (3p) - compute the Cholesky factorization of a complex Hermitian positive definite band matrix A cpbtrf cpbtrf (3p) - compute the Cholesky factorization of a complex Hermitian positive definite band matrix A cpbtrs cpbtrs (3p) - solve a system of linear equations A*X = B with a Hermitian positive definite band matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPBTRF cplus_demangle demangle (3) - decode a C++ encoded symbol name cplx.intro cplx.intro (3) - introduction to C++ complex number math library cplxerr cplxerr (3) - error-handling functions in the C++ complex number math library cplxexp cplxexp (3) - functions in the C++ complex number math library cplxops cplxops (3) - arithmetic operator functions in the C++ complex number math library cplxtrig cplxtrig (3) - trigonometric functions in the C++ complex number math library cpoco cpoco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A. If the condition number is not needed then xPOFA is slightly faster. It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. cpocon cpocon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF cpodi cpodi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC. cpoequ cpoequ (3p) - compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the two-norm) cpofa cpofa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A. It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. cporfs cporfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite, cposl cposl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x. cposv cposv (3p) - compute the solution to a complex system of linear equations A * X = B, cposvx cposvx (3p) - use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B, cpotf2 cpotf2 (3p) - compute the Cholesky factorization of a complex Hermitian positive definite matrix A cpotrf cpotrf (3p) - compute the Cholesky factorization of a complex Hermitian positive definite matrix A cpotri cpotri (3p) - compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF cpotrs cpotrs (3p) - solve a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF cppco cppco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage. If the condition number is not needed then xPPFA is slightly faster. It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. cppcon cppcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite packed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF cppdi cppdi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA. cppequ cppequ (3p) - compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm) cppfa cppfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage. It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. cpprfs cpprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward error estimates for the solution cppsl cppsl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x. cppsv cppsv (3p) - compute the solution to a complex system of linear equations A * X = B, cppsvx cppsvx (3p) - use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B, cpptrf cpptrf (3p) - compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format cpptri cpptri (3p) - compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF cpptrs cpptrs (3p) - solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF cptcon cptcon (3p) - compute the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by CPTTRF cpteqr cpteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using SPTTRF and then calling CBDSQR to compute the singular values of the bidiagonal factor cptrfs cptrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution cptsl cptsl (3p) - solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x. cptsv cptsv (3p) - compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices cptsvx cptsvx (3p) - use the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices cpttrf cpttrf (3p) - compute the factorization of a complex Hermitian positive definite tridiagonal matrix A cpttrs cpttrs (3p) - solve a system of linear equations A * X = B with a Hermitian positive definite tridiagonal matrix A using the factorization A = U**H*D*U or A = L*D*L**H computed by CPTTRF cqrdc cqrdc (3p) - compute the QR factorization of a general matrix A. It is typical to follow a call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A. cqrsl cqrsl (3p) - solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x. crot crot (3p) - apply a plane rotation, where the cos (C) is real and the sin (S) is complex, and the vectors CX and CY are complex crotg crotg (3p) - Construct a Given's plane rotation cscal cscal (3p) - Compute y := alpha * y cscope cscope (1) - interactively examine a C program csico csico (3p) - compute the UDU factorization and condition number of a symmetric matrix A. If the condition number is not needed then xSIFA is slightly faster. It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. csidi csidi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA. csifa csifa (3p) - compute the UDU factorization of a symmetric matrix A. It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. csisl csisl (3p) - solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x. cspco cspco (3p) - compute the UDU factorization and condition number of a symmetric matrix A in packed storage. If the condition number is not needed then xSPFA is slightly faster. It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. cspcon cspcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF cspdi cspdi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA. cspfa cspfa (3p) - compute the UDU factorization of a symmetric matrix A in packed storage. It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. cspmv cspmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y, cspr cspr (3p) - perform the symmetric rank 1 operation A := alpha*x*conjg( x' ) + A, csprfs csprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution cspsl cspsl (3p) - solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x. cspsv cspsv (3p) - compute the solution to a complex system of linear equations A * X = B, cspsvx cspsvx (3p) - use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices csptrf csptrf (3p) - compute the factorization of a complex symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method csptri csptri (3p) - compute the inverse of a complex symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF csptrs csptrs (3p) - solve a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF csrot csrot (3p) - Apply a plane rotation csrscl csrscl (3p) - multiply an n-element complex vector x by the real scalar 1/a csscal csscal (3p) - Compute y := alpha * y cstedc cstedc (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method cstein cstein (3p) - compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration csteqr csteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method cstsv cstsv (3p) - compute the solution to a complex system of linear equations A * X = B where A is a Hermitian tridiagonal matrix csttrf csttrf (3p) - compute the factorization of a complex Hermitian tridiagonal matrix A csttrs csttrs (3p) - computes the solution to a complex system of linear equations A * X = B csvdc csvdc (3p) - compute the singular value decomposition of a general matrix A. cswap cswap (3p) - Exchange vectors x and y. csycon csycon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF csymm csymm (3p) - perform one of the matrix-matrix operations C := alpha*A*B + beta*C or C := alpha*B*A + beta*C csymv csymv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y, csyr csyr (3p) - perform the symmetric rank 1 operation A := alpha*x*( x' ) + A, csyr2k csyr2k (3p) - perform one of the symmetric rank 2k operations C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C csyrfs csyrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution csyrk csyrk (3p) - perform one of the symmetric rank k operations C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C csysv csysv (3p) - compute the solution to a complex system of linear equations A * X = B, csysvx csysvx (3p) - use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B, csytf2 csytf2 (3p) - compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method csytrf csytrf (3p) - compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method csytri csytri (3p) - compute the inverse of a complex symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF csytrs csytrs (3p) - solve a system of linear equations A*X = B with a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF ctags etags (1) - generate tag file for Emacs, vi ctbcon ctbcon (3p) - estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm ctbmv ctbmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x ctbrfs ctbrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix ctbsv ctbsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b ctbtrs ctbtrs (3p) - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B, ctgevc ctgevc (3p) - compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B) ctgsja ctgsja (3p) - compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B ctime time (3f) - return system time ctime64 time (3f) - return system time ctpcon ctpcon (3p) - estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm ctpmv ctpmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x ctprfs ctprfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix ctpsv ctpsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b ctptri ctptri (3p) - compute the inverse of a complex upper or lower triangular matrix A stored in packed format ctptrs ctptrs (3p) - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B, ctrace ctrace (1) - C program debugger ctrans ctrans (3p) - transpose and scale source matrix .HP 1i SUBROUTINE CTRANS(PLACE, SCALE, SOURCE, N1, N2, DEST) .HP 1i CHARACTER*1 PLACE .HP 1i INTEGER N1, N2 .HP 1i COMPLEX SCALE, SOURCE(N1, N2), DEST(N2, N1) .HP 1i .HP 1i #include .HP 1i void ctrans(char place, complex *scale, complex *source, int n1, int n2, complex *dest) ; ctrco ctrco (3p) - estimate the condition number of a triangular matrix A. It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A. ctrcon ctrcon (3p) - estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm ctrdi ctrdi (3p) - compute the determinant and inverse of a triangular matrix A. ctrevc ctrevc (3p) - compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T ctrexc ctrexc (3p) - reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row index IFST is moved to row ILST ctrmm ctrmm (3p) - perform one of the matrix-matrix operations B := alpha*op( A )*B, or B := alpha*B*op( A ) where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of op( A ) = A or op( A ) = A' or op( A ) = conjg( A' ) ctrmv ctrmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x ctrrfs ctrrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix ctrsen ctrsen (3p) - reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in the leading positions on the diagonal of the upper triangular matrix T, and the leading columns of Q form an orthonormal basis of the corresponding right invariant subspace ctrsl ctrsl (3p) - solve the linear system Ax = b for a triangular matrix A and vectors b and x. ctrsm ctrsm (3p) - solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B ctrsna ctrsna (3p) - estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper triangular matrix T (or of any matrix Q*T*Q**H with Q unitary) ctrsv ctrsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b ctrsyl ctrsyl (3p) - solve the complex Sylvester matrix equation ctrti2 ctrti2 (3p) - compute the inverse of a complex upper or lower triangular matrix ctrtri ctrtri (3p) - compute the inverse of a complex upper or lower triangular matrix A ctrtrs ctrtrs (3p) - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B, ctype ctype (3c++/3) - A facet that includes character classification facilities. ctype_byname ctype_byname (3c++/3) - A facet that includes character classification facilities based on the named locales. ctzrqf ctzrqf (3p) - reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations cung2l cung2l (3p) - generate an m by n complex matrix Q with orthonormal columns, cung2r cung2r (3p) - generate an m by n complex matrix Q with orthonormal columns, cungbr cungbr (3p) - generate one of the complex unitary matrices Q or P**H determined by CGEBRD when reducing a complex matrix A to bidiagonal form cunghr cunghr (3p) - generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by CGEHRD cungl2 cungl2 (3p) - generate an m-by-n complex matrix Q with orthonormal rows, cunglq cunglq (3p) - generate an M-by-N complex matrix Q with orthonormal rows, cungql cungql (3p) - generate an M-by-N complex matrix Q with orthonormal columns, cungqr cungqr (3p) - generate an M-by-N complex matrix Q with orthonormal columns, cungr2 cungr2 (3p) - generate an m by n complex matrix Q with orthonormal rows, cungrq cungrq (3p) - generate an M-by-N complex matrix Q with orthonormal rows, cungtr cungtr (3p) - generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by CHETRD cunm2l cunm2l (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', cunm2r cunm2r (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', cunmbr cunmbr (3p) - VECT = 'Q', CUNMBR overwrites the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cunmhr cunmhr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cunml2 cunml2 (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', cunmlq cunmlq (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cunmql cunmql (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cunmqr cunmqr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cunmr2 cunmr2 (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', cunmrq cunmrq (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cunmtr cunmtr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cupgtr cupgtr (3p) - generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by CHPTRD using packed storage cupmtr cupmtr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' cvmul cvmul (3p) - compute the scaled product of complex vectors .HP 1i SUBROUTINE CVMUL(N, ALPHA, X, INCX, Y, INCY, BETA, Z, INCZ) .HP 1i INTEGER N, INCX, INCY, INCZ .HP 1i COMPLEX ALPHA, BETA, X(*), Y(*), Z(*) .HP 1i .HP 1i #include .HP 1i void cvmul(int n, complex *alpha, complex *x, int incx, complex *y, int incy, complex *beta, complex *z, int incz) ; cxref cxref (1) - generate C program cross-reference dasum dasum (3p) - Return the sum of the absolute values of a vector x. date date (3f) - return date in character form date_and_time date_and_time (3f) - Returns date and time in character form daxpy daxpy (3p) - Compute y := alpha * x + y dbdsqr dbdsqr (3p) - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B dbx dbx (1) - source-level debugging tool dbxinit dbxinit (4) - commands to dbx dbxrc dbxrc (4) - commands to dbx dchdc dchdc (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. dchdd dchdd (3p) - downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. dchex dchex (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. dchud dchud (3p) - update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. dcnvcor dcnvcor (3p) - compute the convolution or correlation of double precision vectors .HP 1i SUBROUTINE DCNVCOR (CNVCOR, FOUR, NX, X, IFX, INCX, NY, NPRE, M, Y, IFY, INC1Y, INC2Y, NZ, K, Z, IFZ, INC1Z, INC2Z, WORK, LWORK) .HP 1i CHARACTER CNVCOR, FOUR .HP 1i INTEGER IFX, IFY, IFZ, INCX, INC1Y, INC2Y, INC1Z, INC2Z, K, LWORK, NPRE, NX, NY, M, NZ .HP 1i DOUBLE PRECISION X(*), Y(*), Z(*) .HP 1i DOUBLE PRECISION WORK(*) .HP 1i .HP 1i .HP 1i #include .HP 1i void dcnvcor(char cnvcor, char four, int nx, float *x, int ifx, int incx, int ny, int npre, int m, float *y, int ify, int inc1y, int inc2y, int nz, int k, float *z, int ifz, int inc1z, int inc2z, float *work, int lwork); dcnvcor2 dcnvcor2 (3p) - compute the convolution or correlation of real matrices .HP 1i SUBROUTINE DCNVCOR2 (CNVCOR, METHOD, TRANSX, SCRATCHX, TRANSY, SCRATCHY, MX, NX, X, LDX, MY, NY, MPRE, NPRE, Y, LDY, MZ, NZ, Z, LDZ, WORK, LWORK) .HP 1i CHARACTER CNVCOR, METHOD, SCRATCHX, SCRATCHY, TRANSX, TRANSY .HP 1i INTEGER LDX, LDY, LDZ, LWORK, MPRE, MX, MY, MZ, NPRE, NX, NY, NZ .HP 1i DOUBLE PRECISION WORK(*), X(*), Y(*), Z(*) .HP 1i .HP 1i .HP 1i #include .HP 1i void dcnvcor2(char cnvcor, char method, char transx, char scratchx, char transy, char scratchy, int mx, int nx, double *x, int ldx, int my, int ny, int mpre, int npre, double *y, int ldy, int mz, int nz, double *z, int ldz, doublecomplex *workin, int lwork); dcopy dcopy (3p) - Copy x to y dcosqb dcosqb (3p) - synthesize a Fourier sequence from its representation in terms of a cosine series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. dcosqf dcosqf (3p) - compute the Fourier coefficients in a cosine series representation with only odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. dcosqi dcosqi (3p) - initialize the array xWSAVE, which is used in both xCOSQF and xCOSQB. dcost dcost (3p) - compute the discrete Fourier cosine transform of an even sequence. The xCOST transforms are unnormalized inverses of themselves, so a call of xCOST followed by another call of xCOST will multiply the input sequence by 2 * (N-1). The VxCOST transforms are normalized, so a call of VxCOST followed by a call of VxCOST will return the original sequence. dcosti dcosti (3p) - initialize the array xWSAVE, which is used in xCOST. ddisna ddisna (3p) - compute the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general m-by-n matrix ddot ddot (3p) - Compute the dot product of two vectors x and y. def.dir.flp def.dir.flp (1) - default directory file list program dem dem (1) - demangle a C++ name demangle demangle (3) - decode a C++ encoded symbol name deque deque (3c++/3) - A sequence that supports random access iterators and efficient insertion/deletion at both beginning and end. dfft2b dfft2b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. dfft2f dfft2f (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. dfft2i dfft2i (3p) - initialize the array xWSAVE, which is used in both xFFT2F and xFFT2B. dfft3b dfft3b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. dfft3f dfft3f (3p) - compute the Fourier coefficients of a real periodic sequence. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. dfft3i dfft3i (3p) - initialize the array xWSAVE, which is used in both xFFT3F and xFFT3B. dfftb dfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. dfftf dfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. dffti dffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. dfftopt dfftopt (3p) - compute the length of the closest fast FFT .HP 1i INTEGER FUNCTION DFFTOPT(N) .HP 1i INTEGER N .HP 1i .HP 1i #include .HP 1i int dfftopt(int len); dgbbrd dgbbrd (3p) - reduce a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation dgbco dgbco (3p) - compute the LU factorization and condition number of a general matrix A in banded storage. If the condition number is not needed then xGBFA is slightly faster. It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. dgbcon dgbcon (3p) - estimate the reciprocal of the condition number of a real general band matrix A, in either the 1-norm or the infinity-norm, dgbdi dgbdi (3p) - compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA. dgbequ dgbequ (3p) - compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number dgbfa dgbfa (3p) - compute the LU factorization of a matrix A in banded storage. It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. dgbmv dgbmv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y dgbrfs dgbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution dgbsl dgbsl (3p) - solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x. dgbsv dgbsv (3p) - compute the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices dgbsvx dgbsvx (3p) - use the LU factorization to compute the solution to a real system of linear equations A * X = B, A**T * X = B, or A**H * X = B, dgbtf2 dgbtf2 (3p) - compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges dgbtrf dgbtrf (3p) - compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges dgbtrs dgbtrs (3p) - solve a system of linear equations A * X = B or A' * X = B with a general band matrix A using the LU factorization computed by DGBTRF dgebak dgebak (3p) - form the right or left eigenvectors of a real general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by DGEBAL dgebal dgebal (3p) - balance a general real matrix A dgebd2 dgebd2 (3p) - reduce a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation dgebrd dgebrd (3p) - reduce a general real M-by-N matrix A to upper or lower bidiagonal form B by an orthogonal transformation dgeco dgeco (3p) - compute the LU factorization and estimate the condition number of a general matrix A. If the condition number is not needed then xGEFA is slightly faster. It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A. dgecon dgecon (3p) - estimate the reciprocal of the condition number of a general real matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by DGETRF dgedi dgedi (3p) - compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA. dgeequ dgeequ (3p) - compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number dgees dgees (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z dgeesx dgeesx (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z dgeev dgeev (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors dgeevx dgeevx (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors dgefa dgefa (3p) - compute the LU factorization of a general matrix A. It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A. dgegs dgegs (3p) - compute for a pair of N-by-N real nonsymmetric matrices A, B dgegv dgegv (3p) - compute for a pair of n-by-n real nonsymmetric matrices A and B, the generalized eigenvalues (alphar +/- alphai*i, beta), and optionally, the left and/or right generalized eigenvectors (VL and VR) dgehd2 dgehd2 (3p) - reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation dgehrd dgehrd (3p) - reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation dgelq2 dgelq2 (3p) - compute an LQ factorization of a real m by n matrix A dgelqf dgelqf (3p) - compute an LQ factorization of a real M-by-N matrix A dgels dgels (3p) - solve overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A dgelss dgelss (3p) - compute the minimum norm solution to a real linear least squares problem dgelsx dgelsx (3p) - compute the minimum-norm solution to a real linear least squares problem dgemm dgemm (3p) - perform one of the matrix matrix operations C := alpha*op( A )*op( B ) + beta*C dgemv dgemv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y dgeql2 dgeql2 (3p) - compute a QL factorization of a real m by n matrix A dgeqlf dgeqlf (3p) - compute a QL factorization of a real M-by-N matrix A dgeqpf dgeqpf (3p) - compute a QR factorization with column pivoting of a real M-by-N matrix A dgeqr2 dgeqr2 (3p) - compute a QR factorization of a real m by n matrix A dgeqrf dgeqrf (3p) - compute a QR factorization of a real M-by-N matrix A dger dger (3p) - perform the rank 1 operation A := alpha*x*y' + A dgerfs dgerfs (3p) - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution dgerq2 dgerq2 (3p) - compute an RQ factorization of a real m by n matrix A dgerqf dgerqf (3p) - compute an RQ factorization of a real M-by-N matrix A dgesl dgesl (3p) - solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x. dgesv dgesv (3p) - compute the solution to a real system of linear equations A * X = B, dgesvd dgesvd (3p) - compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and/or right singular vectors dgesvx dgesvx (3p) - use the LU factorization to compute the solution to a real system of linear equations A * X = B, dgetf2 dgetf2 (3p) - compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges dgetrf dgetrf (3p) - compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges dgetri dgetri (3p) - compute the inverse of a matrix using the LU factorization computed by DGETRF dgetrs dgetrs (3p) - solve a system of linear equations A * X = B or A' * X = B with a general N-by-N matrix A using the LU factorization computed by DGETRF dggbak dggbak (3p) - form the right or left eigenvectors of a real generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by DGGBAL dggbal dggbal (3p) - balance a pair of general real matrices (A,B) dggglm dggglm (3p) - solve a general Gauss-Markov linear model (GLM) problem dgghrd dgghrd (3p) - reduce a pair of real matrices (A,B) to generalized upper Hessenberg form using orthogonal transformations, where A is a general matrix and B is upper triangular dgglse dgglse (3p) - solve the linear equality-constrained least squares (LSE) problem dggqrf dggqrf (3p) - compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B dggrqf dggrqf (3p) - compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B dggsvd dggsvd (3p) - compute the generalized singular value decomposition (GSVD) of an M-by-N real matrix A and P-by-N real matrix B dggsvp dggsvp (3p) - compute orthogonal matrices U, V and Q such that N-K-L K L U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0 dgtcon dgtcon (3p) - estimate the reciprocal of the condition number of a real tridiagonal matrix A using the LU factorization as computed by DGTTRF dgtrfs dgtrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution dgtsl dgtsl (3p) - solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x. dgtsv dgtsv (3p) - solve the equation A*X = B, dgtsvx dgtsvx (3p) - use the LU factorization to compute the solution to a real system of linear equations A * X = B or A**T * X = B, dgttrf dgttrf (3p) - compute an LU factorization of a real tridiagonal matrix A using elimination with partial pivoting and row interchanges dgttrs dgttrs (3p) - solve one of the systems of equations A*X = B or A'*X = B, dhgeqz dhgeqz (3p) - implement a single-shift or double-shift version of the QZ method for finding the generalized eigenvalues w(j)=(ALPHAR(j) + i*ALPHAI(j))/BETAR(j) of the equation det( A-w(i) B ) = 0 In addition, the pair A,B may be reduced to generalized Schur form dhsein dhsein (3p) - use inverse iteration to find specified right and/or left eigenvectors of a real upper Hessenberg matrix H dhseqr dhseqr (3p) - compute the eigenvalues of a real upper Hessenberg matrix H and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**T, where T is an upper quasi-triangular matrix (the Schur form), and Z is the orthogonal matrix of Schur vectors distance distance (3c++/3) - Computes the distance between two iterators. divides divides (3c++/3) - Returns the result of dividing its first argument by its second. dlabad dlabad (3p) - take as input the values computed by SLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large dlabrd dlabrd (3p) - reduce the first NB rows and columns of a real general m by n matrix A to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A dlacon dlacon (3p) - estimate the 1-norm of a square, real matrix A dlacpy dlacpy (3p) - copie all or part of a two-dimensional matrix A to another matrix B dladiv dladiv (3p) - perform complex division in real arithmetic (p + i*q) = (a + i*b) / (c + i*d) The algorithm is due to Robert L dlae2 dlae2 (3p) - compute the eigenvalues of a 2-by-2 symmetric matrix [ A B ] [ B C ] dlaebz dlaebz (3p) - contain the iteration loops which compute and use the function N(w), which is the count of eigenvalues of a symmetric tridiagonal matrix T less than or equal to its argument w dlaed0 dlaed0 (3p) - compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method dlaed1 dlaed1 (3p) - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix dlaed2 dlaed2 (3p) - merge the two sets of eigenvalues together into a single sorted set dlaed3 dlaed3 (3p) - find the roots of the secular equation, as defined by the values in D, W, and RHO, between KSTART and KSTOP dlaed4 dlaed4 (3p) - subroutine computes the I-th updated eigenvalue of a symmetric rank-one modification to a diagonal matrix whose elements are given in the array d, and that D(i) < D(j) for i < j and that RHO > 0 dlaed5 dlaed5 (3p) - subroutine computes the I-th eigenvalue of a symmetric rank-one modification of a 2-by-2 diagonal matrix diag( D ) + RHO The diagonal elements in the array D are assumed to satisfy D(i) < D(j) for i < j dlaed6 dlaed6 (3p) - compute the positive or negative root (closest to the origin) of f(x) = rho + (z(1) / (d(1)-x)) + (z(2) / (d(2)-x)) + (z(3) / (d(3)-x)) It is assumed that if ORGATI = .true dlaed7 dlaed7 (3p) - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix dlaed8 dlaed8 (3p) - merge the two sets of eigenvalues together into a single sorted set dlaed9 dlaed9 (3p) - find the roots of the secular equation, as defined by the values in D, Z, and RHO, between KSTART and KSTOP dlaeda dlaeda (3p) - compute the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem dlaein dlaein (3p) - use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg matrix H dlaev2 dlaev2 (3p) - compute the eigendecomposition of a 2-by-2 symmetric matrix [ A B ] [ B C ] dlaexc dlaexc (3p) - swap adjacent diagonal blocks T11 and T22 of order 1 or 2 in an upper quasi-triangular matrix T by an orthogonal similarity transformation dlag2 dlag2 (3p) - compute the eigenvalues of a 2 x 2 generalized eigenvalue problem A-wB, with scaling as necessary to avoid overflow/underflow dlags2 dlags2 (3p) - compute 2-by-2 orthogonal matrices U, V and Q, such that if ( UPPER ) then U'*A*Q = U'*( A1 A2 )*Q = ( x 0 ) ( 0 A3 ) ( x x ) and V'*B*Q = V'*( B1 B2 )*Q = ( x 0 ) ( 0 B3 ) ( x x ) or if ( .NOT.UPPER ) then U'*A*Q = U'*( A1 0 )*Q = ( x x ) ( A2 A3 ) ( 0 x ) and V'*B*Q = V'*( B1 0 )*Q = ( x x ) ( B2 B3 ) ( 0 x ) The rows of the transformed A and B are parallel, where U = ( CSU SNU ), V = ( CSV SNV ), Q = ( CSQ SNQ ) (-SNU CSU ) (-SNV CSV ) (-SNQ CSQ ) Z' denotes the transpose of Z dlagtf dlagtf (3p) - factorize the matrix (T-lambda*I), where T is an n by n tridiagonal matrix and lambda is a scalar, as T-lambda*I = PLU, dlagtm dlagtm (3p) - perform a matrix-vector product of the form B := alpha * A * X + beta * B where A is a tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta are real scalars, each of which may be zero, one, or minus one dlagts dlagts (3p) - may be used to solve one of the systems of equations (T-lambda*I)*x = y or (T-lambda*I)'*x = y, dlahqr dlahqr (3p) - i an auxiliary routine called by DHSEQR to update the eigenvalues and Schur decomposition already computed by DHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI dlahrd dlahrd (3p) - reduce the first NB columns of a real general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero dlaic1 dlaic1 (3p) - apply one step of incremental condition estimation in its simplest version dlaln2 dlaln2 (3p) - solve a system of the form (ca A-wD ) X = s B or (ca A'-wD) X = s B with possible scaling ("s") and perturbation of A dlamch dlamch (3p) - determine double precision machine parameters dlamrg dlamrg (3p) - will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order dlangb dlangb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals dlange dlange (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real matrix A dlangt dlangt (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real tridiagonal matrix A dlanhs dlanhs (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A dlansb dlansb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals dlansp dlansp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A, supplied in packed form dlanst dlanst (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric tridiagonal matrix A dlansy dlansy (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A dlantb dlantb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals dlantp dlantp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form dlantr dlantr (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A dlanv2 dlanv2 (3p) - compute the Schur factorization of a real 2-by-2 nonsymmetric matrix in standard form dlapll dlapll (3p) - two column vectors X and Y, let A = ( X Y ) dlapmt dlapmt (3p) - rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N dlapy2 dlapy2 (3p) - return sqrt(x**2+y**2), taking care not to cause unnecessary overflow dlapy3 dlapy3 (3p) - return sqrt(x**2+y**2+z**2), taking care not to cause unnecessary overflow dlaqgb dlaqgb (3p) - equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C dlaqge dlaqge (3p) - equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C dlaqsb dlaqsb (3p) - equilibrate a symmetric band matrix A using the scaling factors in the vector S dlaqsp dlaqsp (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S dlaqsy dlaqsy (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S dlaqtr dlaqtr (3p) - solve the real quasi-triangular system op(T)*p = scale*c, if LREAL = .TRUE dlar2v dlar2v (3p) - apply a vector of real plane rotations from both sides to a sequence of 2-by-2 real symmetric matrices, defined by the elements of the vectors x, y and z dlarf dlarf (3p) - apply a real elementary reflector H to a real m by n matrix C, from either the left or the right dlarfb dlarfb (3p) - apply a real block reflector H or its transpose H' to a real m by n matrix C, from either the left or the right dlarfg dlarfg (3p) - generate a real elementary reflector H of order n, such that H * ( alpha ) = ( beta ), H' * H = I dlarft dlarft (3p) - form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors dlarfx dlarfx (3p) - apply a real elementary reflector H to a real m by n matrix C, from either the left or the right dlargv dlargv (3p) - generate a vector of real plane rotations, determined by elements of the real vectors x and y dlarnv dlarnv (3p) - return a vector of n random real numbers from a uniform or normal distribution dlartg dlartg (3p) - generate a plane rotation so that [ CS SN ] dlartv dlartv (3p) - apply a vector of real plane rotations to elements of the real vectors x and y dlaruv dlaruv (3p) - return a vector of n random real numbers from a uniform (0,1) dlas2 dlas2 (3p) - compute the singular values of the 2-by-2 matrix [ F G ] [ 0 H ] dlascl dlascl (3p) - multiply the M by N real matrix A by the real scalar CTO/CFROM dlaset dlaset (3p) - initialize an m-by-n matrix A to BETA on the diagonal and ALPHA on the offdiagonals dlasq1 dlasq1 (3p) - DLASQ1 computes the singular values of a real N-by-N bidiagonal matrix with diagonal D and off-diagonal E dlasq2 dlasq2 (3p) - DLASQ2 computes the singular values of a real N-by-N unreduced bidiagonal matrix with squared diagonal elements in Q and squared off-diagonal elements in E dlasq3 dlasq3 (3p) - DLASQ3 is the workhorse of the whole bidiagonal SVD algorithm dlasq4 dlasq4 (3p) - DLASQ4 estimates TAU, the smallest eigenvalue of a matrix dlasr dlasr (3p) - perform the transformation A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) where A is an m by n real matrix and P is an orthogonal matrix, dlasrt dlasrt (3p) - the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ) dlassq dlassq (3p) - return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, dlasv2 dlasv2 (3p) - compute the singular value decomposition of a 2-by-2 triangular matrix [ F G ] [ 0 H ] dlaswp dlaswp (3p) - perform a series of row interchanges on the matrix A dlasy2 dlasy2 (3p) - solve for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in op(TL)*X + ISGN*X*op(TR) = SCALE*B, dlasyf dlasyf (3p) - compute a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method dlatbs dlatbs (3p) - solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an upper or lower triangular band matrix dlatps dlatps (3p) - solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an upper or lower triangular matrix stored in packed form dlatrd dlatrd (3p) - reduce NB rows and columns of a real symmetric matrix A to symmetric tridiagonal form by an orthogonal similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A dlatrs dlatrs (3p) - solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow dlatzm dlatzm (3p) - apply a Householder matrix generated by DTZRQF to a matrix dlauu2 dlauu2 (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A dlauum dlauum (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A dmake dmake (1) - DistributedMake dnrm2 dnrm2 (3p) - Return the Euclidian norm of a vector. dopgtr dopgtr (3p) - generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by DSPTRD using packed storage dopmtr dopmtr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' doptimal_workspace doptimal_workspace (3p) - Get the optimal amount of workspace for the last routine called that supports varying length .HP 1i .HP 1i #include .HP 1i double workspace. dorg2l dorg2l (3p) - generate an m by n real matrix Q with orthonormal columns, dorg2r dorg2r (3p) - generate an m by n real matrix Q with orthonormal columns, dorgbr dorgbr (3p) - generate one of the real orthogonal matrices Q or P**T determined by DGEBRD when reducing a real matrix A to bidiagonal form dorghr dorghr (3p) - generate a real orthogonal matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by DGEHRD dorgl2 dorgl2 (3p) - generate an m by n real matrix Q with orthonormal rows, dorglq dorglq (3p) - generate an M-by-N real matrix Q with orthonormal rows, dorgql dorgql (3p) - generate an M-by-N real matrix Q with orthonormal columns, dorgqr dorgqr (3p) - generate an M-by-N real matrix Q with orthonormal columns, dorgr2 dorgr2 (3p) - generate an m by n real matrix Q with orthonormal rows, dorgrq dorgrq (3p) - generate an M-by-N real matrix Q with orthonormal rows, dorgtr dorgtr (3p) - generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by DSYTRD dorm2l dorm2l (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dorm2r dorm2r (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dormbr dormbr (3p) - VECT = 'Q', DORMBR overwrites the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormhr dormhr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dorml2 dorml2 (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dormlq dormlq (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormql dormql (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormqr dormqr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormr2 dormr2 (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', dormrq dormrq (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dormtr dormtr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' dpbco dpbco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage. If the condition number is not needed then xPBFA is slightly faster. It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. dpbcon dpbcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite band matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPBTRF dpbdi dpbdi (3p) - compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA. dpbequ dpbequ (3p) - compute row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm) dpbfa dpbfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage. It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. dpbrfs dpbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and provides error bounds and backward error estimates for the solution dpbsl dpbsl (3p) - section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x. dpbstf dpbstf (3p) - compute a split Cholesky factorization of a real symmetric positive definite band matrix A dpbsv dpbsv (3p) - compute the solution to a real system of linear equations A * X = B, dpbsvx dpbsvx (3p) - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, dpbtf2 dpbtf2 (3p) - compute the Cholesky factorization of a real symmetric positive definite band matrix A dpbtrf dpbtrf (3p) - compute the Cholesky factorization of a real symmetric positive definite band matrix A dpbtrs dpbtrs (3p) - solve a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPBTRF dpoco dpoco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A. If the condition number is not needed then xPOFA is slightly faster. It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. dpocon dpocon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF dpodi dpodi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC. dpoequ dpoequ (3p) - compute row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm) dpofa dpofa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A. It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. dporfs dporfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, dposl dposl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x. dposv dposv (3p) - compute the solution to a real system of linear equations A * X = B, dposvx dposvx (3p) - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, dpotf2 dpotf2 (3p) - compute the Cholesky factorization of a real symmetric positive definite matrix A dpotrf dpotrf (3p) - compute the Cholesky factorization of a real symmetric positive definite matrix A dpotri dpotri (3p) - compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF dpotrs dpotrs (3p) - solve a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF dppco dppco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage. If the condition number is not needed then xPPFA is slightly faster. It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. dppcon dppcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite packed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF dppdi dppdi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA. dppequ dppequ (3p) - compute row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm) dppfa dppfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage. It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. dpprfs dpprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and packed, and provides error bounds and backward error estimates for the solution dppsl dppsl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x. dppsv dppsv (3p) - compute the solution to a real system of linear equations A * X = B, dppsvx dppsvx (3p) - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, dpptrf dpptrf (3p) - compute the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format dpptri dpptri (3p) - compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF dpptrs dpptrs (3p) - solve a system of linear equations A*X = B with a symmetric positive definite matrix A in packed storage using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF dptcon dptcon (3p) - compute the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite tridiagonal matrix using the factorization A = L*D*L**T or A = U**T*D*U computed by DPTTRF dpteqr dpteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF, and then calling DBDSQR to compute the singular values of the bidiagonal factor dptrfs dptrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution dptsl dptsl (3p) - solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x. dptsv dptsv (3p) - compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices dptsvx dptsvx (3p) - use the factorization A = L*D*L**T to compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix and X and B are N-by-NRHS matrices dpttrf dpttrf (3p) - compute the factorization of a real symmetric positive definite tridiagonal matrix A dpttrs dpttrs (3p) - solve a system of linear equations A * X = B with a symmetric positive definite tridiagonal matrix A using the factorization A = L*D*L**T or A = U**T*D*U computed by DPTTRF dqdota dqdota (3p) - Compute a double precision constant plus an extended precision constant plus the extended precision dot product of two double precision vectors x and y. dqdoti dqdoti (3p) - Compute a constant plus the extended precision dot product of two double precision vectors x and y. dqrdc dqrdc (3p) - compute the QR factorization of a general matrix A. It is typical to follow a call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A. dqrsl dqrsl (3p) - solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x. drand rand (3f) - return random values drot drot (3p) - Apply a Given's rotation constructed by DROTG. drotg drotg (3p) - Construct a Given's plane rotation drotm drotm (3p) - Apply a Gentleman's modified Given's rotation constructed by DROTMG. drotmg drotmg (3p) - Construct a Gentleman's modified Given's plane rotation drscl drscl (3p) - multiply an n-element real vector x by the real scalar 1/a dsbev dsbev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A dsbevd dsbevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A dsbevx dsbevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A dsbgst dsbgst (3p) - reduce a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, dsbgv dsbgv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x dsbmv dsbmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y dsbtrd dsbtrd (3p) - reduce a real symmetric band matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation dscal dscal (3p) - Compute y := alpha * y dsdot dsdot (3p) - Compute the double precision dot product of two single precision vectors x and y. dsecnd dsecnd (3p) - return the user time for a process in seconds. dsico dsico (3p) - compute the UDU factorization and condition number of a symmetric matrix A. If the condition number is not needed then xSIFA is slightly faster. It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. dsidi dsidi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA. dsifa dsifa (3p) - compute the UDU factorization of a symmetric matrix A. It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. dsinqb dsinqb (3p) - synthesize a Fourier sequence from its representation in terms of a sine series with odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. dsinqf dsinqf (3p) - compute the Fourier coefficients in a sine series representation with only odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. dsinqi dsinqi (3p) - initialize the array xWSAVE, which is used in both xSINQF and xSINQB. dsint dsint (3p) - compute the discrete Fourier sine transform of an odd sequence. The xSINT transforms are unnormalized inverses of themselves, so a call of xSINT followed by another call of xSINT will multiply the input sequence by 2 * (N+1). The VxSINT transforms are normalized, so a call of VxSINT followed by a call of VxSINT will return the original sequence. dsinti dsinti (3p) - initialize the array xWSAVE, which is used in subroutine xSINT. dsisl dsisl (3p) - solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x. dspco dspco (3p) - compute the UDU factorization and condition number of a symmetric matrix A in packed storage. If the condition number is not needed then xSPFA is slightly faster. It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. dspcon dspcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF dspdi dspdi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA. dspev dspev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage dspevd dspevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage dspevx dspevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage dspfa dspfa (3p) - compute the UDU factorization of a symmetric matrix A in packed storage. It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. dspgst dspgst (3p) - reduce a real symmetric-definite generalized eigenproblem to standard form, using packed storage dspgv dspgv (3p) - compute all the eigenvalues and, optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dspmv dspmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y dspr dspr (3p) - perform the symmetric rank 1 operation A := alpha*x*x' + A dspr2 dspr2 (3p) - perform the symmetric rank 2 operation A := alpha*x*y' + alpha*y*x' + A dsprfs dsprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution dspsl dspsl (3p) - solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x. dspsv dspsv (3p) - compute the solution to a real system of linear equations A * X = B, dspsvx dspsvx (3p) - use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices dsptrd dsptrd (3p) - reduce a real symmetric matrix A stored in packed form to symmetric tridiagonal form T by an orthogonal similarity transformation dsptrf dsptrf (3p) - compute the factorization of a real symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method dsptri dsptri (3p) - compute the inverse of a real symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF dsptrs dsptrs (3p) - solve a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF dstebz dstebz (3p) - compute the eigenvalues of a symmetric tridiagonal matrix T dstedc dstedc (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method dstein dstein (3p) - compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration dsteqr dsteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method dsterf dsterf (3p) - compute all eigenvalues of a symmetric tridiagonal matrix using the Pal-Walker-Kahan variant of the QL or QR algorithm dstev dstev (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A dstevd dstevd (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix dstevx dstevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A dstsv dstsv (3p) - compute the solution to a system of linear equations A * X = B where A is a symmetric tridiagonal matrix dsttrf dsttrf (3p) - compute the factorization of a symmetric tridiagonal matrix A dsttrs dsttrs (3p) - computes the solution to a double precision system of linear equations A * X = B dsvdc dsvdc (3p) - compute the singular value decomposition of a general matrix A. dswap dswap (3p) - Exchange vectors x and y. dsycon dsycon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF dsyev dsyev (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A dsyevd dsyevd (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A dsyevx dsyevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A dsygs2 dsygs2 (3p) - reduce a real symmetric-definite generalized eigenproblem to standard form dsygst dsygst (3p) - reduce a real symmetric-definite generalized eigenproblem to standard form dsygv dsygv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x dsymm dsymm (3p) - perform one of the matrix-matrix operations C := alpha*A*B + beta*C or C := alpha*B*A + beta*C dsymv dsymv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y dsyr dsyr (3p) - perform the symmetric rank 1 operation A := alpha*x*x' + A dsyr2 dsyr2 (3p) - perform the symmetric rank 2 operation A := alpha*x*y' + alpha*y*x' + A dsyr2k dsyr2k (3p) - perform one of the symmetric rank 2k operations C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C dsyrfs dsyrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution dsyrk dsyrk (3p) - perform one of the symmetric rank k operations C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C dsysv dsysv (3p) - compute the solution to a real system of linear equations A * X = B, dsysvx dsysvx (3p) - use the diagonal pivoting factorization to compute the solution to a real system of linear equations A * X = B, dsytd2 dsytd2 (3p) - reduce a real symmetric matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation dsytf2 dsytf2 (3p) - compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method dsytrd dsytrd (3p) - reduce a real symmetric matrix A to real symmetric tridiagonal form T by an orthogonal similarity transformation dsytrf dsytrf (3p) - compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method dsytri dsytri (3p) - compute the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF dsytrs dsytrs (3p) - solve a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF dtbcon dtbcon (3p) - estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm dtbmv dtbmv (3p) - perform one of the matrix-vector operations x := A*x or x := A'*x dtbrfs dtbrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix dtbsv dtbsv (3p) - solve one of the systems of equations A*x = b or A'*x = b dtbtrs dtbtrs (3p) - solve a triangular system of the form A * X = B or A**T * X = B, dtgevc dtgevc (3p) - compute some or all of the right and/or left generalized eigenvectors of a pair of real upper triangular matrices (A,B) dtgsja dtgsja (3p) - compute the generalized singular value decomposition (GSVD) of two real upper triangular (or trapezoidal) matrices A and B dtime etime (3f) - return elapsed time dtpcon dtpcon (3p) - estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm dtpmv dtpmv (3p) - perform one of the matrix-vector operations x := A*x or x := A'*x dtprfs dtprfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix dtpsv dtpsv (3p) - solve one of the systems of equations A*x = b or A'*x = b dtptri dtptri (3p) - compute the inverse of a real upper or lower triangular matrix A stored in packed format dtptrs dtptrs (3p) - solve a triangular system of the form A * X = B or A**T * X = B, dtrans dtrans (3p) - transpose and scale source matrix .HP 1i SUBROUTINE DTRANS(PLACE, SCALE, SOURCE, N1, N2, DEST) .HP 1i CHARACTER*1 PLACE .HP 1i INTEGER N1, N2 .HP 1i DOUBLE PRECISION SCALE, SOURCE(N1, N2), DEST(N2, N1) .HP 1i .HP 1i #include .HP 1i void dtrans(char place, double scale, double *source, int n1, int n2, double *dest) ; dtrco dtrco (3p) - estimate the condition number of a triangular matrix A. It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A. dtrcon dtrcon (3p) - estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm dtrdi dtrdi (3p) - compute the determinant and inverse of a triangular matrix A. dtrevc dtrevc (3p) - compute some or all of the right and/or left eigenvectors of a real upper quasi-triangular matrix T dtrexc dtrexc (3p) - reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that the diagonal block of T with row index IFST is moved to row ILST dtrmm dtrmm (3p) - perform one of the matrix-matrix operations B := alpha*op( A )*B, or B := alpha*B*op( A ) dtrmv dtrmv (3p) - perform one of the matrix-vector operations x := A*x or x := A'*x dtrrfs dtrrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix dtrsen dtrsen (3p) - reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix T, dtrsl dtrsl (3p) - solve the linear system Ax = b for a triangular matrix A and vectors b and x. dtrsm dtrsm (3p) - solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B dtrsna dtrsna (3p) - estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a real upper quasi-triangular matrix T (or of any matrix Q*T*Q**T with Q orthogonal) dtrsv dtrsv (3p) - solve one of the systems of equations A*x = b or A'*x = b dtrsyl dtrsyl (3p) - solve the real Sylvester matrix equation dtrti2 dtrti2 (3p) - compute the inverse of a real upper or lower triangular matrix dtrtri dtrtri (3p) - compute the inverse of a real upper or lower triangular matrix A dtrtrs dtrtrs (3p) - solve a triangular system of the form A * X = B or A**T * X = B, dtzrqf dtzrqf (3p) - reduce the M-by-N ( M<=N ) real upper trapezoidal matrix A to upper triangular form by means of orthogonal transformations dumpstabs dumpstabs (1) - utility for dumping out debug information dwiener dwiener (3p) - perform Wiener deconvolution of two signals dzasum dzasum (3p) - Return the sum of the absolute values of a vector x. dznrm2 dznrm2 (3p) - Return the Euclidian norm of a vector. dzsum1 dzsum1 (3p) - take the sum of the absolute values of a complex vector and returns a double precision result equal equal (3c++/3) - Compares two ranges for equality. equal_range equal_range (3c++/3) - Find the largest subrange in a collection into which a given value can be inserted without violating the ordering of the collection. equal_to equal_to (3c++/3) - A binary function object that returns true if its first argument equals its second. er_export er_export (1) - export experiment data to a file. er_mapgen er_mapgen (1) - generates a mapfile using an experiment that has been generated by the .B Sampling Collector in the .B Sun WorkShop Debugging window. er_mv er_mv (1) - move experiment er_print er_print (1) - print an ASCII version of the various displays supported by the Sampling Analyzer er_rm er_rm (1) - remove (unlink) experiments. error cplxerr (3) - error-handling functions in the C++ complex number math library etags etags (1) - generate tag file for Emacs, vi etime etime (3f) - return elapsed time exception exception (3c++/3) - A class that supports logic and runtime errors. exit exit (3f) - terminate process with status exp cplxexp (3) - functions in the C++ complex number math library exp10 exp2 (3m) - exponential, logarithm, financial exp2 exp2 (3m) - exponential, logarithm, financial ezfftb ezfftb (3p) - computes a periodic sequence from its Fourier coefficients. EZFFTB is a simplified but slower version of RFFTB. ezfftf ezfftf (3p) - computes the Fourier coefficients of a periodic sequence. EZFFTF is a simplified but slower version of RFFTF. ezffti ezffti (3p) - initializes the array WSAVE, which is used in both EZFFTF and EZFFTB. f77 f77 (1) - FORTRAN 77 compiler f77_floatingpoint f77_floatingpoint (3f) - FORTRAN IEEE floating-point definitions f77_ieee_environment f77_ieee_environment (3f) - mode, status, and signal handling for IEEE arithmetic f90 f90 (1) - FORTRAN 90 compiler facets facets (3c++/3) - A family of classes used to encapsulate categories of locale functionality. fbe fbe (1) - assembler fdate fdate (3f) - return date and time in an ASCII string feclearexcept feclearexcept (3m) - access floating point exception flags fegetenv fegetenv (3m) - manage the floating point environment fegetexceptflag feclearexcept (3m) - access floating point exception flags fegetprec fesetprec (3m) - control floating point rounding precision modes fegetround fesetround (3m) - control floating point rounding direction modes feholdexcept fegetenv (3m) - manage the floating point environment feraiseexcept feclearexcept (3m) - access floating point exception flags fesetenv fegetenv (3m) - manage the floating point environment fesetexceptflag feclearexcept (3m) - access floating point exception flags fesetprec fesetprec (3m) - control floating point rounding precision modes fesetround fesetround (3m) - control floating point rounding direction modes fetestexcept feclearexcept (3m) - access floating point exception flags feupdateenv fegetenv (3m) - manage the floating point environment fex_get_handling fex_set_handling (3m) - control floating point exception handling modes fex_get_log fex_set_log (3m) - log retrospective diagnostics for floating point exceptions fex_get_log_depth fex_set_log (3m) - log retrospective diagnostics for floating point exceptions fex_getexcepthandler fex_set_handling (3m) - control floating point exception handling modes fex_log_entry fex_set_log (3m) - log retrospective diagnostics for floating point exceptions fex_merge_flags fegetenv (3m) - manage the floating point environment fex_set_handling fex_set_handling (3m) - control floating point exception handling modes fex_set_log fex_set_log (3m) - log retrospective diagnostics for floating point exceptions fex_set_log_depth fex_set_log (3m) - log retrospective diagnostics for floating point exceptions fex_setexcepthandler fex_set_handling (3m) - control floating point exception handling modes fgetc getc (3f) - get a character from a logical unit filebuf filebuf (3cc4/3) - buffer class for file I/O filemerge twmerge (1) - twmerge is a window-based file comparison and merging program fill fill (3c++/3) - Initializes a range with a given value. fill_n fill (3c++/3) - Initializes a range with a given value. find find (3c++/3) - Finds an occurrence of value in a sequence. find_end find_end (3c++/3) - Finds the last occurrence of a sub-sequence in a sequence. find_first_of find_first_of (3c++/3) - Finds the first occurrence of any value from one sequence in another sequence. find_if find_if (3c++/3) - Finds an occurrence of a value in a sequence that satisfies a specified predicate. flush flush (3f) - flush output to a logical unit for_each for_each (3c++/3) - Applies a function to each element in a range. fork fork (3f) - create a copy of this process fp_class ieee_sun (3m) - miscellaneous functions for IEEE arithmetic fpos fpos (3c++/3) - Maintains position information fort he iostream classes. fpp fpp (1) - the Fortran language preprocessor for FORTRAN 77 and Fortran 90. fpr fpr (1) - convert FORTRAN carriage-control output to printable form fputc putc (3f) - write a character to a FORTRAN logical unit fpversion fpversion (1) - print information about the system CPU and FPU free free (3f) - deallocate a region of memory allocated by malloc freezepointfile freezepointfile (4) - format of a freezepoint file .LP freezept freezept (1) - generate or translate SCCS Mergeable delta IDs for lists of files freezepttool twfreeze (1) - generate or translate SCCS Mergeable delta IDs for lists of files front_insert_iterator front_insert_iterator (3c++/3) - An insert iterator used to insert items at the beginning of a collection. front_inserter front_insert_iterator (3c++/3) - An insert iterator used to insert items at the beginning of a collection. fseek fseek (3f) - reposition a file on a logical unit fseeko64 fseek (3f) - reposition a file on a logical unit fsplit fsplit (1) - split a multi-routine FORTRAN 90 or FORTRAN 77 source file into individual files. fstat stat (3f) - get file status fstat64 stat64 (3f) - get file status for long files fstream fstream (3cc4/3) - stream class for file I/O ftell fseek (3f) - reposition a file on a logical unit ftello64 fseek (3f) - reposition a file on a logical unit generate generate (3c++/3) - Initialize a container with values produced by a value-generator class. generate_n generate (3c++/3) - Initialize a container with values produced by a value-generator class. gerror perror (3f) - get system error messages get_temporary_buffer get_temporary_buffer (3c++/3) - Pointer based primitive for handling memory getarg getarg (3f) - get the kth command-line argument getc getc (3f) - get a character from a logical unit getcwd getcwd (3f) - get the path name of the current working directory getenv getenv (3f) - get value of environment variables getfd getfd (3f) - get the file descriptor of an external unit number getfilep getfilep (3f) - get the file pointer of an external unit number getgid getuid (3f) - get user or group ID of the caller getlog getlog (3f) - get user's login name getpid getpid (3f) - get process id getuid getuid (3f) - get user or group ID of the caller gil2xd gil2xd (1) - Converts GIL source to WorkShop Visual save files gmtime time (3f) - return system time gmtime64 time (3f) - return system time gnuclient gnuserv (1) - Server and Clients for XEmacs gnuserv gnuserv (1) - Server and Clients for XEmacs greater greater (3c++/3) - A binary function object that returns true if its first argument is greater than its second. greater_equal greater_equal (3c++/3) - A binary function object that returns true if its first argument is greater than or equal to its second gslice gslice (3c++/3) - A numeric array class used to represent a generalized slice from an array. gslice_array gslice_array (3c++/3) - A numeric array class used to represent a BLAS-like slice from a valarray. has_facet has_facet (3c++/3) - A function template used to determine if a locale has a given facet. history history (4) - Workspace command and file-change log hostnm hostnm (3f) - get name of current host iargc getarg (3f) - get the kth command-line argument icamax icamax (3p) - Return the index of the element with largest absolute value. icmax1 icmax1 (3p) - find the index of the element whose real part has maximum absolute value idamax idamax (3p) - Return the index of the element with largest absolute value. idate idate (3f) - return date in numerical form ieee_flags ieee_flags (3m) - mode and status function for IEEE standard arithmetic ieee_handler ieee_handler (3m) - IEEE exception trap handler function ieee_retrospective ieee_sun (3m) - miscellaneous functions for IEEE arithmetic ieee_sun ieee_sun (3m) - miscellaneous functions for IEEE arithmetic ieee_values ieee_values (3m) - functions that return extreme values of IEEE arithmetic ierrno perror (3f) - get system error messages ilaenv ilaenv (3p) - choose problem-dependent parameters ild ild (1) - incremental link editor (ild) for object files includes includes (3c++/3) - A basic set of operation for sorted sequences. indent indent (1) - indent and format a C program source file index index (3f) - get index or length of substring indirect_array indirect_array (3c++/3) - A numeric array class used to represent elements selected from a valarray. infinity ieee_values (3m) - functions that return extreme values of IEEE arithmetic inline inline (1) - in-line procedure call expander inner_product inner_product (3c++/3) - Computes the inner product A X B of two ranges A and B. inplace_merge inplace_merge (3c++/3) - Merges two sorted sequences into one. insert_iterator insert_iterator (3c++/3) - An insert iterator used to insert items into a collection rather than overwrite the collection. inserter insert_iterator (3c++/3) - An insert iterator used to insert items into a collection rather than overwrite the collection. interrupt interrupt (3) - signal handling for the task library intro Intro (3m) - introduction to mathematical library functions and constants intro intro (1) - introduction to FORTRAN manual pages intro intro (3f) - introduction to FORTRAN library functions and subroutines ioinit ioinit (3f) - initialize I/O: carriage control, blanks, append, file names ios ios (3cc4/3) - basic iostreams formatting ios.intro ios.intro (3cc4/3) - introduction to iostreams and the man pages ios_base ios_base (3c++/3) - Defines member types and maintains data for classes that inherit from it. iosfwd iosfwd (3c++/3) - The header iosfwd forward declares the input/output library template classes and specializes them for wide and tiny characters. It also defines the positional types used in class char_traits instantiated on tiny and wide characters. irand rand (3f) - return random values irint aint (3m) - round to integral value in floating-point or integer format isalnum isalnum (3c++/3) - Determines if a character is alphabetic or numeric. isalpha isalpha (3c++/3) - Determines if a character is alphabetic. isamax isamax (3p) - Return the index of the element with largest absolute value. isatty ttynam (3f) - find name of terminal port; also: is unit a terminal? iscntrl iscntrl (3c++/3) - Determines if a character is a control character. isdigit isdigit (3c++/3) - Determines if a character is a decimal digit. isetjmp longjmp (3f) - longjmp returns to the location set by isetjmp isgraph isgraph (3c++/3) - Determines if a character is a graphic character. isinf ieee_sun (3m) - miscellaneous functions for IEEE arithmetic islower islower (3c++/3) - Determines whether a character is lower case. isnormal ieee_sun (3m) - miscellaneous functions for IEEE arithmetic isprint isprint (3c++/3) - Determines if a character is printable. ispunct ispunct (3c++/3) - Determines if a character is punctuation. isspace isspace (3c++/3) - Determines if a character is a space. issubnormal ieee_sun (3m) - miscellaneous functions for IEEE arithmetic istream istream (3cc4/3) - formatted and unformatted input istream_iterator istream_iterator (3c++/3) - A stream iterator that has iterator capabilities for istreams. This iterator allows generic algorithms to be used directly on streams. istreambuf_iterator istreambuf_iterator (3c++/3) - Reads successive characters from the stream buffer for which it was constructed. istrstream istrstream (3c++/3) - Reads characters from an array in memory. isupper isupper (3c++/3) - Determines whether a character is upper case. isxdigit isxdigit (3c++/3) - Determines whether a character is a hexadecimal digit. iszero ieee_sun (3m) - miscellaneous functions for IEEE arithmetic iter_swap iter_swap (3c++/3) - Exchanges values in two locations. iterator iterator (3c++/3) - A base iterator class. iterator_traits iterator_traits (3c++/3) - Returns basic information about an iterator. itime itime (3f) - return time in numerical form izamax izamax (3p) - Return the index of the element with largest absolute value. izmax1 izmax1 (3p) - find the index of the element whose real part has maximum absolute value kill kill (3f) - send a signal to a process lapack lapack (3p) - introduction to LAPACK lcrans lcrans (3m) - linear congruential pseudo-random number generators len index (3f) - get index or length of substring less less (3c++/3) - A binary function object that returns true if its first argument is less than its second. less_equal less_equal (3c++/3) - A binary function object that returns true if its first argument is less than or equal to its second. lexicographical_compare lexicographical_compare (3c++/3) - Compares two ranges lexicographically. libm_double libm_double (3f) - FORTRAN access to double precision libm functions and subroutines libm_quadruple libm_quadruple (3f) - FORTRAN access to quadruple-precision functions (SPARC only) libm_single libm_single (3f) - FORTRAN access to single-precision libm functions libmvec libmvec (3m) - vector versions of some elementary mathematical functions link link (3f) - make a link to an existing file lint lint (1) - a C program checker list list (3c++/3) - A sequence that supports bidirectional iterators. lnblnk index (3f) - get index or length of substring loc loc (3f) - return the address of an object locale locale (3c++/3) - A localization class containing a polymorphic set of facets. lock_lint lock_lint (1) - verify use of locks in multi-threaded programs locks locks (4) - TeamWare locks file log cplxexp (3) - functions in the C++ complex number math library log10 cplxexp (3) - functions in the C++ complex number math library log2 exp2 (3m) - exponential, logarithm, financial logical_and logical_and (3c++/3) - A binary function object that returns true if both of its arguments are true. logical_not logical_not (3c++/3) - A unary function object that returns true if its argument is false. logical_or logical_or (3c++/3) - A binary function object that returns true if either of its arguments are true. long long (3f) - integer object conversion longjmp longjmp (3f) - longjmp returns to the location set by isetjmp loopreport loopreport (1) - print loop timing data to stdout looptool looptool (1) - graphically display loop timing data lower_bound lower_bound (3c++/3) - Determine the first valid position for an element in a sorted container. lsame lsame (3p) - case-insensitive comparison of two characters lsamen lsamen (3p) - test if the first N letters of CA are the same as the first N letters of CB, regardless of case lstat stat (3f) - get file status lstat64 stat64 (3f) - get file status for long files ltime time (3f) - return system time ltime64 time (3f) - return system time make_heap make_heap (3c++/3) - Creates a heap. maketool twbuild (1) - twbuild is a graphical user interface (GUI) tool for Sun WorkShop TeamWare Building commands. malloc malloc (3f) - allocate memory and return the address malloc64 malloc (3f) - allocate memory and return the address manip manip (3cc4/3) - iostream manipulators map map (3c++/3) - An associative container with access to non-key values using unique keys. A map supports bidirectional iterators. mask_array mask_array (3c++/3) - A numeric array class that gives a masked view of a valarray. max max (3c++/3) - Finds and returns the maximum of a pair of values. max_element max_element (3c++/3) - Finds the maximum value in a range. max_normal ieee_values (3m) - functions that return extreme values of IEEE arithmetic max_subnormal ieee_values (3m) - functions that return extreme values of IEEE arithmetic mem_fun mem_fun (3c++/3) - Function objects that adapt a pointer to a member function, to take the place of a global function. mem_fun1 mem_fun (3c++/3) - Function objects that adapt a pointer to a member function, to take the place of a global function. mem_fun_ref mem_fun (3c++/3) - Function objects that adapt a pointer to a member function, to take the place of a global function. mem_fun_ref1 mem_fun (3c++/3) - Function objects that adapt a pointer to a member function, to take the place of a global function. merge merge (3c++/3) - Merges two sorted sequences into a third sequence. messages messages (3c++/3) - Messaging facets. messages_byname messages (3c++/3) - Messaging facets. min min (3c++/3) - Finds and returns the minimum of a pair of values. min_element min_element (3c++/3) - Finds the minimum value in a range. min_normal ieee_values (3m) - functions that return extreme values of IEEE arithmetic min_subnormal ieee_values (3m) - functions that return extreme values of IEEE arithmetic minus minus (3c++/3) - Returns the result of subtracting its second argument from its first. mismatch mismatch (3c++/3) - Compares elements from two sequences and returns the first two elements that don't match each other. modulus modulus (3c++/3) - Returns the remainder obtained by dividing the first argument by the second argument. money_get money_get (3c++/3) - Monetary formatting facet for input. money_put money_put (3c++/3) - Monetary formatting facet for output. moneypunct moneypunct (3c++/3) - Monetary punctuation facets. moneypunct_byname moneypunct (3c++/3) - Monetary punctuation facets. multimap multimap (3c++/3) - An associative container that gives access to non-key values using keys. multimap keys are not required to be unique. A multimap supports bidirectional iterators. multiplies multiplies (3c++/3) - A binary function object that returns the result of multiplying its first and second arguments. multiset multiset (3c++/3) - An associative container that allows fast access to stored key values. Storage of duplicate keys is allowed. A multiset supports bidirectional iterators. mvbits mvbits (3f) - move specified bits mwcrans mwcrans (3m) - multiply with carry pseudo-random number generators nametable nametable (4) - CodeManager file name table negate negate (3c++/3) - Unary function object that returns the negation of its argument. next_permutation next_permutation (3c++/3) - Generates successive permutations of a sequence based on an ordering function. nint aint (3m) - round to integral value in floating-point or integer format nonstandard_arithmetic ieee_sun (3m) - miscellaneous functions for IEEE arithmetic not1 not1 (3c++/3) - A function adaptor used to reverse the sense of a unary predicate function object. not2 not2 (3c++/3) - A function adaptor used to reverse the sense of a binary predicate function object. not_equal_to not_equal_to (3c++/3) - A binary function object that returns true if its first argument is not equal to its second. notification notification (4) - TeamWare notification file nth_element nth_element (3c++/3) - Rearranges a collection so that all elements lower in sorted order than the nth element come before it and all elements higher in sorter order than the nth element come after it. num_get num_get (3c++/3) - A numeric formatting facet for input. num_put num_put (3c++/3) - A numeric formatting facet for output. numeric_limits numeric_limits (3c++/3) - A class for representing information about scalar types. numpunct numpunct (3c++/3) - A numeric punctuation facet. numpunct_byname numpunct (3c++/3) - A numeric punctuation facet. ostream ostream (3cc4/3) - formatted and unformatted output ostream_iterator ostream_iterator (3c++/3) - Stream iterators allow for use of iterators with ostreams and istreams. They allow generic algorithms to be used directly on streams. ostreambuf_iterator ostreambuf_iterator (3c++/3) - Writes successive characters onto the stream buffer object from which it was constructed. ostrstream ostrstream (3c++/3) - Writes to an array in memory. pair pair (3c++/3) - A template for heterogeneous pairs of values. parent parent (4) - Path name of a workspace's parent partial_sort partial_sort (3c++/3) - Templatized algorithm for sorting collections of entities. partial_sort_copy partial_sort_copy (3c++/3) - Templatized algorithm for sorting collections of entities. partial_sum partial_sum (3c++/3) - Calculates successive partial sums of a range of values. partition partition (3c++/3) - Places all of the entities that satisfy the given predicate before all of the entities that do not. permutation permutation (3c++/3) - Generates successive permutations of a sequence based on an ordering function. See the entries for next_permutation and prev-_permutation. perror perror (3f) - get system error messages plus plus (3c++/3) - A binary function object that returns the result of adding its first and second arguments. pointer_to_binary_function pointer_to_binary_function (3c++/3) - A function object that adapts a pointer to a binary function, to take the place of a binary_function. pointer_to_unary_function pointer_to_unary_function (3c++/3) - A function object class that adapts a pointer to a function, to take the place of a unary_function. pop_heap pop_heap (3c++/3) - Moves the largest element off the heap. pow cplxexp (3) - functions in the C++ complex number math library prev_permutation prev_permutation (3c++/3) - Generates successive permutations of a sequence based on an ordering function. priority_queue priority_queue (3c++/3) - A container adapter that behaves like a priority queue. Items popped from the queue are in order with respect to a "priority." ptclean ptclean (1) - clean up the parameterized types database ptr_fun ptr_fun (3c++/3) - A function that is overloaded to adapt a pointer to a function, to take the place of a function. push_heap push_heap (3c++/3) - Places a new element into a heap. putback putback (1) - copy files from a child workspace to its parent workspace putback.cmt putback.cmt (4) - Putback transaction comment log file putc putc (3f) - write a character to a FORTRAN logical unit qsort qsort (3f) - quick sort qsort64 qsort (3f) - quick sort quad_precision quad_precision (3m) - Quadruple-precision access to libm and libsunmath functions queue queue (3) - list management for the task library queue queue (3c++/3) - A container adaptor that behaves like a queue (first in, first out). quiet_nan ieee_values (3m) - functions that return extreme values of IEEE arithmetic ran ran (3f) - return a random number between 0 and 1 rand rand (3f) - return random values random_shuffle random_shuffle (3c++/3) - Randomly shuffles elements of a collection. ratfor ratfor (1) - rational FORTRAN dialect raw_storage_iterator raw_storage_iterator (3c++/3) - Enables iterator-based algorithms to store results into uninitialized memory. rcs2ws rcs2ws (1) - produce a TeamWare workspace from an .SM RCS source hiearchy remove remove (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. remove_copy remove_copy (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. remove_copy_if remove_copy_if (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. remove_if remove_if (3c++/3) - Moves desired elements to the front of a container, and returns an iterator that describes where the sequence of desired elements ends. rename rename (3f) - rename a file replace replace (3c++/3) - Substitutes elements in a collection with new values. replace_copy replace_copy (3c++/3) - Substitutes elements in a collection with new values, and moves the revised sequence into result. replace_copy_if replace_copy_if (3c++/3) - Substitutes elements in a collection with new values, and moves the revised sequence into result. replace_if replace_if (3c++/3) - Substitutes elements in a collection with new values. resolve resolve (1) - merge files in conflict using interactive commands and/or Filemerge return_temporary_buffer return_temporary_buffer (3c++/3) - A pointer-based primitive for handling memory. .RE .RS 0 #include .br template .br void return_temporary_buffer (T* p, T*); reverse reverse (3c++/3) - Reverses the order of elements in a collection. reverse_copy reverse_copy (3c++/3) - Reverses the order of elements in a collection while copying them to a new collection. reverse_iterator __reverse_bi_iterator (3c++/3) - An iterator that traverses a collection backwards. __reverse_bi_iterator is included for those compilers that do not support partial specialization. The template signature for reverse_iterator matches that of __reverse_bi_iterator when partial specialization is not available (in other words, it has six template parameters rather than one). rfft2b rfft2b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. rfft2f rfft2f (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. rfft2i rfft2i (3p) - initialize the array xWSAVE, which is used in both xFFT2F and xFFT2B. rfft3b rfft3b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. rfft3f rfft3f (3p) - compute the Fourier coefficients of a real periodic sequence. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. rfft3i rfft3i (3p) - initialize the array xWSAVE, which is used in both xFFT3F and xFFT3B. rfftb rfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. rfftf rfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. rffti rffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. rfftopt rfftopt (3p) - compute the length of the closest fast FFT .HP 1i INTEGER FUNCTION RFFTOPT(N) .HP 1i INTEGER N .HP 1i .HP 1i #include .HP 1i int rfftopt(int len); rindex index (3f) - get index or length of substring rotate rotate (3c++/3) - Swaps the segment that contains elements from first through middle-1 with the segment that contains the elements from middle through last. rotate_copy rotate (3c++/3) - Swaps the segment that contains elements from first through middle-1 with the segment that contains the elements from middle through last. rtc_api _rtc_check_free (3x) - Runtime Checking (RTC) API for the use of private memory allocators. rtc_patch_area rtc_patch_area (1) - patch area utility for Runtime Checking (SPARC only) sasum sasum (3p) - Return the sum of the absolute values of a vector x. saxpy saxpy (3p) - Compute y := alpha * x + y sbcleanup sbcleanup (1) - deletes old Source Browsing database files sbdsqr sbdsqr (3p) - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B sbenter sbenter (1) - generate SourceBrowser database with more general information sbfocus sbfocus (1) - generate SourceBrowser data file for focus units sbinit sbinit (4) - directives to SourceBrowser and compilers sbquery sbquery (1) - command-line interface to the Source Browsing mode of WorkShop sbtags sbtags (1) - create database files for the Source Browsing mode of WorkShop sbufprot sbufprot (3cc4/3) - protected interface of the stream buffer base class sbufpub sbufpub (3cc4/3) - public interface of the stream buffer base class scasum scasum (3p) - Return the sum of the absolute values of a vector x. schdc schdc (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. schdd schdd (3p) - downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. schex schex (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. schud schud (3p) - update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. scnrm2 scnrm2 (3p) - Return the Euclidian norm of a vector. scnvcor scnvcor (3p) - compute the convolution or correlation of real vectors .HP 1i SUBROUTINE SCNVCOR (CNVCOR, FOUR, NX, X, IFX, INCX, NY, NPRE, M, Y, IFY, INC1Y, INC2Y, NZ, K, Z, IFZ, INC1Z, INC2Z, WORK, LWORK) .HP 1i CHARACTER CNVCOR, FOUR .HP 1i INTEGER IFX, IFY, IFZ, INCX, INC1Y, INC2Y, INC1Z, INC2Z, K, LWORK, NPRE, NX, NY, M, NZ .HP 1i REAL X(*), Y(*), Z(*) .HP 1i REAL WORK(*) .HP 1i .HP 1i .HP 1i #include .HP 1i void scnvcor(char cnvcor, char four, int nx, float *x, int ifx, int incx, int ny, int npre, int m, float *y, int ify, int inc1y, int inc2y, int nz, int k, float *z, int ifz, int inc1z, int inc2z, float *work, int lwork); scnvcor2 scnvcor2 (3p) - compute the convolution or correlation of real matrices .HP 1i SUBROUTINE SCNVCOR2 (CNVCOR, METHOD, TRANSX, SCRATCHX, TRANSY, SCRATCHY, MX, NX, X, LDX, MY, NY, MPRE, NPRE, Y, LDY, MZ, NZ, Z, LDZ, WORK, LWORK) .HP 1i CHARACTER CNVCOR, METHOD, SCRATCHX, SCRATCHY, TRANSX, TRANSY .HP 1i INTEGER LDX, LDY, LDZ, LWORK, MPRE, MX, MY, MZ, NPRE, NX, NY, NZ .HP 1i REAL X(*), Y(*), Z(*) .HP 1i REAL WORK(*) .HP 1i .HP 1i .HP 1i #include .HP 1i void scnvcor2(char cnvcor, char method, char transx, char scratchx, char transy, char scratchy, int mx, int nx, float *x, int ldx, int my, int ny, int mpre, int npre, float *y, int ldy, int mz, int nz, float *z, int ldz, complex *workin, int lwork); scopy scopy (3p) - Copy x to y scsum1 scsum1 (3p) - take the sum of the absolute values of a complex vector and returns a single precision result sdisna sdisna (3p) - compute the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general m-by-n matrix sdot sdot (3p) - Compute the dot product of two vectors x and y. sdsdot sdsdot (3p) - Compute a constant plus the double precision dot product of two single precision vectors x and y. search search (3c++/3) - Finds a sub-sequence within a sequence of values that is element-wise equal to the values in an indicated range. search_n search (3c++/3) - Finds a sub-sequence within a sequence of values that is element-wise equal to the values in an indicated range. secnds secnds (3f) - return system time in seconds since midnight second second (3p) - return the user time for a process in seconds. set set (3c++/3) - An associative container that supports unique keys. A set supports bidirectional iterators. set_difference set_difference (3c++/3) - A basic set operation for constructing a sorted difference. set_intersection set_intersection (3c++/3) - A basic set operation for constructing a sorted intersection. set_symmetric_difference set_symmetric_difference (3c++/3) - A basic set operation for constructing a sorted symmetric difference. set_union set_union (3c++/3) - A basic set operation for constructing a sorted union. sgbbrd sgbbrd (3p) - reduce a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation sgbco sgbco (3p) - compute the LU factorization and condition number of a general matrix A in banded storage. If the condition number is not needed then xGBFA is slightly faster. It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. sgbcon sgbcon (3p) - estimate the reciprocal of the condition number of a real general band matrix A, in either the 1-norm or the infinity-norm, sgbdi sgbdi (3p) - compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA. sgbequ sgbequ (3p) - compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number sgbfa sgbfa (3p) - compute the LU factorization of a matrix A in banded storage. It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. sgbmv sgbmv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y sgbrfs sgbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution sgbsl sgbsl (3p) - solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x. sgbsv sgbsv (3p) - compute the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices sgbsvx sgbsvx (3p) - use the LU factorization to compute the solution to a real system of linear equations A * X = B, A**T * X = B, or A**H * X = B, sgbtf2 sgbtf2 (3p) - compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges sgbtrf sgbtrf (3p) - compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges sgbtrs sgbtrs (3p) - solve a system of linear equations A * X = B or A' * X = B with a general band matrix A using the LU factorization computed by SGBTRF sgebak sgebak (3p) - form the right or left eigenvectors of a real general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by SGEBAL sgebal sgebal (3p) - balance a general real matrix A sgebd2 sgebd2 (3p) - reduce a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation sgebrd sgebrd (3p) - reduce a general real M-by-N matrix A to upper or lower bidiagonal form B by an orthogonal transformation sgeco sgeco (3p) - compute the LU factorization and estimate the condition number of a general matrix A. If the condition number is not needed then xGEFA is slightly faster. It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A. sgecon sgecon (3p) - estimate the reciprocal of the condition number of a general real matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by SGETRF sgedi sgedi (3p) - compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA. sgeequ sgeequ (3p) - compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number sgees sgees (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z sgeesx sgeesx (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z sgeev sgeev (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors sgeevx sgeevx (3p) - compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors sgefa sgefa (3p) - compute the LU factorization of a general matrix A. It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A. sgegs sgegs (3p) - compute for a pair of N-by-N real nonsymmetric matrices A, B sgegv sgegv (3p) - compute for a pair of n-by-n real nonsymmetric matrices A and B, the generalized eigenvalues (alphar +/- alphai*i, beta), and optionally, the left and/or right generalized eigenvectors (VL and VR) sgehd2 sgehd2 (3p) - reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation sgehrd sgehrd (3p) - reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation sgelq2 sgelq2 (3p) - compute an LQ factorization of a real m by n matrix A sgelqf sgelqf (3p) - compute an LQ factorization of a real M-by-N matrix A sgels sgels (3p) - solve overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A sgelss sgelss (3p) - compute the minimum norm solution to a real linear least squares problem sgelsx sgelsx (3p) - compute the minimum-norm solution to a real linear least squares problem sgemm sgemm (3p) - perform one of the matrix-matrix operations C := alpha*op( A )*op( B ) + beta*C sgemv sgemv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y sgeql2 sgeql2 (3p) - compute a QL factorization of a real m by n matrix A sgeqlf sgeqlf (3p) - compute a QL factorization of a real M-by-N matrix A sgeqpf sgeqpf (3p) - compute a QR factorization with column pivoting of a real M-by-N matrix A sgeqr2 sgeqr2 (3p) - compute a QR factorization of a real m by n matrix A sgeqrf sgeqrf (3p) - compute a QR factorization of a real M-by-N matrix A sger sger (3p) - perform the rank 1 operation A := alpha*x*y' + A sgerfs sgerfs (3p) - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution sgerq2 sgerq2 (3p) - compute an RQ factorization of a real m by n matrix A sgerqf sgerqf (3p) - compute an RQ factorization of a real M-by-N matrix A sgesl sgesl (3p) - solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x. sgesv sgesv (3p) - compute the solution to a real system of linear equations A * X = B, sgesvd sgesvd (3p) - compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and/or right singular vectors sgesvx sgesvx (3p) - use the LU factorization to compute the solution to a real system of linear equations A * X = B, sgetf2 sgetf2 (3p) - compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges sgetrf sgetrf (3p) - compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges sgetri sgetri (3p) - compute the inverse of a matrix using the LU factorization computed by SGETRF sgetrs sgetrs (3p) - solve a system of linear equations A * X = B or A' * X = B with a general N-by-N matrix A using the LU factorization computed by SGETRF sggbak sggbak (3p) - form the right or left eigenvectors of a real generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by SGGBAL sggbal sggbal (3p) - balance a pair of general real matrices (A,B) sggglm sggglm (3p) - solve a general Gauss-Markov linear model (GLM) problem sgghrd sgghrd (3p) - reduce a pair of real matrices (A,B) to generalized upper Hessenberg form using orthogonal transformations, where A is a general matrix and B is upper triangular sgglse sgglse (3p) - solve the linear equality-constrained least squares (LSE) problem sggqrf sggqrf (3p) - compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B sggrqf sggrqf (3p) - compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B sggsvd sggsvd (3p) - compute the generalized singular value decomposition (GSVD) of an M-by-N real matrix A and P-by-N real matrix B sggsvp sggsvp (3p) - compute orthogonal matrices U, V and Q such that N-K-L K L U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0 sgtcon sgtcon (3p) - estimate the reciprocal of the condition number of a real tridiagonal matrix A using the LU factorization as computed by SGTTRF sgtrfs sgtrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution sgtsl sgtsl (3p) - solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x. sgtsv sgtsv (3p) - solve the equation A*X = B, sgtsvx sgtsvx (3p) - use the LU factorization to compute the solution to a real system of linear equations A * X = B or A**T * X = B, sgttrf sgttrf (3p) - compute an LU factorization of a real tridiagonal matrix A using elimination with partial pivoting and row interchanges sgttrs sgttrs (3p) - solve one of the systems of equations A*X = B or A'*X = B, sh sh (3f) - fast execution of an sh shell command shgeqz shgeqz (3p) - implement a single-shift/double-shift version of the QZ method for finding the generalized eigenvalues w(j)=(ALPHAR(j) + i*ALPHAI(j))/BETAR(j) of the equation det( A-w(i) B ) = 0 In addition, the pair A,B may be reduced to generalized Schur form short long (3f) - integer object conversion shsein shsein (3p) - use inverse iteration to find specified right and/or left eigenvectors of a real upper Hessenberg matrix H shseqr shseqr (3p) - compute the eigenvalues of a real upper Hessenberg matrix H and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**T, where T is an upper quasi-triangular matrix (the Schur form), and Z is the orthogonal matrix of Schur vectors shufrans shufrans (3m) - random number shufflers signal signal (3f) - change the action for a signal signaling_nan ieee_values (3m) - functions that return extreme values of IEEE arithmetic signbit ieee_sun (3m) - miscellaneous functions for IEEE arithmetic sincos trig_sun (3m) - more trigonometric functions sincosd trig_sun (3m) - more trigonometric functions sincosp trig_sun (3m) - more trigonometric functions sincospi trig_sun (3m) - more trigonometric functions sind trig_sun (3m) - more trigonometric functions single_precision single_precision (3m) - Single-precision access to libm and libsunmath functions sinp trig_sun (3m) - more trigonometric functions sinpi trig_sun (3m) - more trigonometric functions sinqb sinqb (3p) - synthesize a Fourier sequence from its representation in terms of a sine series with odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. sinqf sinqf (3p) - compute the Fourier coefficients in a sine series representation with only odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. sinqi sinqi (3p) - initialize the array xWSAVE, which is used in both xSINQF and xSINQB. sint sint (3p) - compute the discrete Fourier sine transform of an odd sequence. The xSINT transforms are unnormalized inverses of themselves, so a call of xSINT followed by another call of xSINT will multiply the input sequence by 2 * (N+1). The VxSINT transforms are normalized, so a call of VxSINT followed by a call of VxSINT will return the original sequence. sinti sinti (3p) - initialize the array xWSAVE, which is used in subroutine xSINT. slabad slabad (3p) - take as input the values computed by SLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large slabrd slabrd (3p) - reduce the first NB rows and columns of a real general m by n matrix A to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A slacon slacon (3p) - estimate the 1-norm of a square, real matrix A slacpy slacpy (3p) - copie all or part of a two-dimensional matrix A to another matrix B sladiv sladiv (3p) - perform complex division in real arithmetic (p + i*q) = (a + i*b) / (c + i*d) The algorithm is due to Robert L slae2 slae2 (3p) - compute the eigenvalues of a 2-by-2 symmetric matrix [ A B ] [ B C ] slaebz slaebz (3p) - contain the iteration loops which compute and use the function N(w), which is the count of eigenvalues of a symmetric tridiagonal matrix T less than or equal to its argument w slaed0 slaed0 (3p) - compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method slaed1 slaed1 (3p) - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix slaed2 slaed2 (3p) - merge the two sets of eigenvalues together into a single sorted set slaed3 slaed3 (3p) - find the roots of the secular equation, as defined by the values in D, W, and RHO, between KSTART and KSTOP slaed4 slaed4 (3p) - subroutine computes the I-th updated eigenvalue of a symmetric rank-one modification to a diagonal matrix whose elements are given in the array d, and that D(i) < D(j) for i < j and that RHO > 0 slaed5 slaed5 (3p) - subroutine computes the I-th eigenvalue of a symmetric rank-one modification of a 2-by-2 diagonal matrix diag( D ) + RHO The diagonal elements in the array D are assumed to satisfy D(i) < D(j) for i < j slaed6 slaed6 (3p) - compute the positive or negative root (closest to the origin) of f(x) = rho + (z(1) / (d(1)-x)) + (z(2) / (d(2)-x)) + (z(3) / (d(3)-x)) It is assumed that if ORGATI = .true slaed7 slaed7 (3p) - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix slaed8 slaed8 (3p) - merge the two sets of eigenvalues together into a single sorted set slaed9 slaed9 (3p) - find the roots of the secular equation, as defined by the values in D, Z, and RHO, between KSTART and KSTOP slaeda slaeda (3p) - compute the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem slaein slaein (3p) - use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg matrix H slaev2 slaev2 (3p) - compute the eigendecomposition of a 2-by-2 symmetric matrix [ A B ] [ B C ] slaexc slaexc (3p) - swap adjacent diagonal blocks T11 and T22 of order 1 or 2 in an upper quasi-triangular matrix T by an orthogonal similarity transformation slag2 slag2 (3p) - compute the eigenvalues of a 2 x 2 generalized eigenvalue problem A-wB, with scaling as necessary to avoid overflow/underflow slags2 slags2 (3p) - compute 2-by-2 orthogonal matrices U, V and Q, such that if ( UPPER ) then U'*A*Q = U'*( A1 A2 )*Q = ( x 0 ) ( 0 A3 ) ( x x ) and V'*B*Q = V'*( B1 B2 )*Q = ( x 0 ) ( 0 B3 ) ( x x ) or if ( .NOT.UPPER ) then U'*A*Q = U'*( A1 0 )*Q = ( x x ) ( A2 A3 ) ( 0 x ) and V'*B*Q = V'*( B1 0 )*Q = ( x x ) ( B2 B3 ) ( 0 x ) The rows of the transformed A and B are parallel, where U = ( CSU SNU ), V = ( CSV SNV ), Q = ( CSQ SNQ ) (-SNU CSU ) (-SNV CSV ) (-SNQ CSQ ) Z' denotes the transpose of Z slagtf slagtf (3p) - factorize the matrix (T-lambda*I), where T is an n by n tridiagonal matrix and lambda is a scalar, as T-lambda*I = PLU, slagtm slagtm (3p) - perform a matrix-vector product of the form B := alpha * A * X + beta * B where A is a tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta are real scalars, each of which may be zero, one, or minus one slagts slagts (3p) - may be used to solve one of the systems of equations (T-lambda*I)*x = y or (T-lambda*I)'*x = y, slahqr slahqr (3p) - i an auxiliary routine called by SHSEQR to update the eigenvalues and Schur decomposition already computed by SHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI slahrd slahrd (3p) - reduce the first NB columns of a real general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero slaic1 slaic1 (3p) - apply one step of incremental condition estimation in its simplest version slaln2 slaln2 (3p) - solve a system of the form (ca A-wD ) X = s B or (ca A'-wD) X = s B with possible scaling ("s") and perturbation of A slamch slamch (3p) - determine single precision machine parameters slamrg slamrg (3p) - will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order slangb slangb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals slange slange (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real matrix A slangt slangt (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real tridiagonal matrix A slanhs slanhs (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A slansb slansb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals slansp slansp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A, supplied in packed form slanst slanst (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric tridiagonal matrix A slansy slansy (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A slantb slantb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals slantp slantp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form slantr slantr (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A slanv2 slanv2 (3p) - compute the Schur factorization of a real 2-by-2 nonsymmetric matrix in standard form slapll slapll (3p) - two column vectors X and Y, let A = ( X Y ) slapmt slapmt (3p) - rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N slapy2 slapy2 (3p) - return sqrt(x**2+y**2), taking care not to cause unnecessary overflow slapy3 slapy3 (3p) - return sqrt(x**2+y**2+z**2), taking care not to cause unnecessary overflow slaqgb slaqgb (3p) - equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C slaqge slaqge (3p) - equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C slaqsb slaqsb (3p) - equilibrate a symmetric band matrix A using the scaling factors in the vector S slaqsp slaqsp (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S slaqsy slaqsy (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S slaqtr slaqtr (3p) - solve the real quasi-triangular system op(T)*p = scale*c, if LREAL = .TRUE slar2v slar2v (3p) - apply a vector of real plane rotations from both sides to a sequence of 2-by-2 real symmetric matrices, defined by the elements of the vectors x, y and z slarf slarf (3p) - apply a real elementary reflector H to a real m by n matrix C, from either the left or the right slarfb slarfb (3p) - apply a real block reflector H or its transpose H' to a real m by n matrix C, from either the left or the right slarfg slarfg (3p) - generate a real elementary reflector H of order n, such that H * ( alpha ) = ( beta ), H' * H = I slarft slarft (3p) - form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors slarfx slarfx (3p) - apply a real elementary reflector H to a real m by n matrix C, from either the left or the right slargv slargv (3p) - generate a vector of real plane rotations, determined by elements of the real vectors x and y slarnv slarnv (3p) - return a vector of n random real numbers from a uniform or normal distribution slartg slartg (3p) - generate a plane rotation so that [ CS SN ] slartv slartv (3p) - apply a vector of real plane rotations to elements of the real vectors x and y slaruv slaruv (3p) - return a vector of n random real numbers from a uniform (0,1) slas2 slas2 (3p) - compute the singular values of the 2-by-2 matrix [ F G ] [ 0 H ] slascl slascl (3p) - multiply the M by N real matrix A by the real scalar CTO/CFROM slaset slaset (3p) - initialize an m-by-n matrix A to BETA on the diagonal and ALPHA on the offdiagonals slasq1 slasq1 (3p) - SLASQ1 computes the singular values of a real N-by-N bidiagonal matrix with diagonal D and off-diagonal E slasq2 slasq2 (3p) - SLASQ2 computes the singular values of a real N-by-N unreduced bidiagonal matrix with squared diagonal elements in Q and squared off-diagonal elements in E slasq3 slasq3 (3p) - SLASQ3 is the workhorse of the whole bidiagonal SVD algorithm slasq4 slasq4 (3p) - SLASQ4 estimates TAU, the smallest eigenvalue of a matrix slasr slasr (3p) - perform the transformation A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) where A is an m by n real matrix and P is an orthogonal matrix, slasrt slasrt (3p) - the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ) slassq slassq (3p) - return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, slasv2 slasv2 (3p) - compute the singular value decomposition of a 2-by-2 triangular matrix [ F G ] [ 0 H ] slaswp slaswp (3p) - perform a series of row interchanges on the matrix A slasy2 slasy2 (3p) - solve for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in op(TL)*X + ISGN*X*op(TR) = SCALE*B, slasyf slasyf (3p) - compute a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method slatbs slatbs (3p) - solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an upper or lower triangular band matrix slatps slatps (3p) - solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an upper or lower triangular matrix stored in packed form slatrd slatrd (3p) - reduce NB rows and columns of a real symmetric matrix A to symmetric tridiagonal form by an orthogonal similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A slatrs slatrs (3p) - solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow slatzm slatzm (3p) - apply a Householder matrix generated by STZRQF to a matrix slauu2 slauu2 (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A slauum slauum (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A sleep sleep (3f) - suspend execution for an interval slice slice (3c++/3) - A numeric array class for representing a BLAS-like slice from an array. slice_array slice_array (3c++/3) - A numeric array class for representing a BLAS-like slice from a valarray. smanip smanip (3c++/3) - Helper classes used to implement parameterized manipulators. smanip_fill smanip (3c++/3) - Helper classes used to implement parameterized manipulators. snrm2 snrm2 (3p) - Return the Euclidian norm of a vector. sopgtr sopgtr (3p) - generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by SSPTRD using packed storage sopmtr sopmtr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' soptimal_workspace soptimal_workspace (3p) - Get the optimal amount of workspace for the last routine called that supports varying length real workspace. sorg2l sorg2l (3p) - generate an m by n real matrix Q with orthonormal columns, sorg2r sorg2r (3p) - generate an m by n real matrix Q with orthonormal columns, sorgbr sorgbr (3p) - generate one of the real orthogonal matrices Q or P**T determined by SGEBRD when reducing a real matrix A to bidiagonal form sorghr sorghr (3p) - generate a real orthogonal matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by SGEHRD sorgl2 sorgl2 (3p) - generate an m by n real matrix Q with orthonormal rows, sorglq sorglq (3p) - generate an M-by-N real matrix Q with orthonormal rows, sorgql sorgql (3p) - generate an M-by-N real matrix Q with orthonormal columns, sorgqr sorgqr (3p) - generate an M-by-N real matrix Q with orthonormal columns, sorgr2 sorgr2 (3p) - generate an m by n real matrix Q with orthonormal rows, sorgrq sorgrq (3p) - generate an M-by-N real matrix Q with orthonormal rows, sorgtr sorgtr (3p) - generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by SSYTRD sorm2l sorm2l (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', sorm2r sorm2r (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', sormbr sormbr (3p) - VECT = 'Q', SORMBR overwrites the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' sormhr sormhr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' sorml2 sorml2 (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', sormlq sormlq (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' sormql sormql (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' sormqr sormqr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' sormr2 sormr2 (3p) - overwrite the general real m by n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'T', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'T', sormrq sormrq (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' sormtr sormtr (3p) - overwrite the general real M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' sort sort (3c++/3) - A templatized algorithm for sorting collections of entities. sort_heap sort_heap (3c++/3) - Converts a heap into a sorted collection. spbco spbco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage. If the condition number is not needed then xPBFA is slightly faster. It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. spbcon spbcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite band matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF spbdi spbdi (3p) - compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA. spbequ spbequ (3p) - compute row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm) spbfa spbfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage. It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. spbrfs spbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and provides error bounds and backward error estimates for the solution spbsl spbsl (3p) - section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x. spbstf spbstf (3p) - compute a split Cholesky factorization of a real symmetric positive definite band matrix A spbsv spbsv (3p) - compute the solution to a real system of linear equations A * X = B, spbsvx spbsvx (3p) - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, spbtf2 spbtf2 (3p) - compute the Cholesky factorization of a real symmetric positive definite band matrix A spbtrf spbtrf (3p) - compute the Cholesky factorization of a real symmetric positive definite band matrix A spbtrs spbtrs (3p) - solve a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF spoco spoco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A. If the condition number is not needed then xPOFA is slightly faster. It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. spocon spocon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPOTRF spodi spodi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC. spoequ spoequ (3p) - compute row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm) spofa spofa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A. It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. sporfs sporfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, sposl sposl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x. sposv sposv (3p) - compute the solution to a real system of linear equations A * X = B, sposvx sposvx (3p) - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, spotf2 spotf2 (3p) - compute the Cholesky factorization of a real symmetric positive definite matrix A spotrf spotrf (3p) - compute the Cholesky factorization of a real symmetric positive definite matrix A spotri spotri (3p) - compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPOTRF spotrs spotrs (3p) - solve a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPOTRF sppco sppco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage. If the condition number is not needed then xPPFA is slightly faster. It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. sppcon sppcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite packed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPPTRF sppdi sppdi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA. sppequ sppequ (3p) - compute row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm) sppfa sppfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage. It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. spprfs spprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and packed, and provides error bounds and backward error estimates for the solution sppsl sppsl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x. sppsv sppsv (3p) - compute the solution to a real system of linear equations A * X = B, sppsvx sppsvx (3p) - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A * X = B, spptrf spptrf (3p) - compute the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format spptri spptri (3p) - compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPPTRF spptrs spptrs (3p) - solve a system of linear equations A*X = B with a symmetric positive definite matrix A in packed storage using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPPTRF sptcon sptcon (3p) - compute the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite tridiagonal matrix using the factorization A = L*D*L**T or A = U**T*D*U computed by SPTTRF spteqr spteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using SPTTRF, and then calling SBDSQR to compute the singular values of the bidiagonal factor sptrfs sptrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution sptsl sptsl (3p) - solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x. sptsv sptsv (3p) - compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices sptsvx sptsvx (3p) - use the factorization A = L*D*L**T to compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix and X and B are N-by-NRHS matrices spttrf spttrf (3p) - compute the factorization of a real symmetric positive definite tridiagonal matrix A spttrs spttrs (3p) - solve a system of linear equations A * X = B with a symmetric positive definite tridiagonal matrix A using the factorization A = L*D*L**T or A = U**T*D*U computed by SPTTRF sqrdc sqrdc (3p) - compute the QR factorization of a general matrix A. It is typical to follow a call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A. sqrsl sqrsl (3p) - solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x. sqrt cplxexp (3) - functions in the C++ complex number math library srot srot (3p) - Apply a Given's rotation constructed by SROTG. srotg srotg (3p) - Construct a Given's plane rotation srotm srotm (3p) - Apply a Gentleman's modified Given's rotation constructed by SROTMG. srotmg srotmg (3p) - Construct a Gentleman's modified Given's plane rotation srscl srscl (3p) - multiply an n-element real vector x by the real scalar 1/a ssbev ssbev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A ssbevd ssbevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A ssbevx ssbevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A ssbgst ssbgst (3p) - reduce a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, ssbgv ssbgv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x ssbmv ssbmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y ssbtrd ssbtrd (3p) - reduce a real symmetric band matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation ssbuf ssbuf (3) - buffer class for for character arrays sscal sscal (3p) - Compute y := alpha * y ssico ssico (3p) - compute the UDU factorization and condition number of a symmetric matrix A. If the condition number is not needed then xSIFA is slightly faster. It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. ssidi ssidi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA. ssifa ssifa (3p) - compute the UDU factorization of a symmetric matrix A. It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. ssisl ssisl (3p) - solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x. sspco sspco (3p) - compute the UDU factorization and condition number of a symmetric matrix A in packed storage. If the condition number is not needed then xSPFA is slightly faster. It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. sspcon sspcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF sspdi sspdi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA. sspev sspev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage sspevd sspevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage sspevx sspevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage sspfa sspfa (3p) - compute the UDU factorization of a symmetric matrix A in packed storage. It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. sspgst sspgst (3p) - reduce a real symmetric-definite generalized eigenproblem to standard form, using packed storage sspgv sspgv (3p) - compute all the eigenvalues and, optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x sspmv sspmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y sspr sspr (3p) - perform the symmetric rank 1 operation A := alpha*x*x' + A sspr2 sspr2 (3p) - perform the symmetric rank 2 operation A := alpha*x*y' + alpha*y*x' + A ssprfs ssprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution sspsl sspsl (3p) - solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x. sspsv sspsv (3p) - compute the solution to a real system of linear equations A * X = B, sspsvx sspsvx (3p) - use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices ssptrd ssptrd (3p) - reduce a real symmetric matrix A stored in packed form to symmetric tridiagonal form T by an orthogonal similarity transformation ssptrf ssptrf (3p) - compute the factorization of a real symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method ssptri ssptri (3p) - compute the inverse of a real symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF ssptrs ssptrs (3p) - solve a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF sstebz sstebz (3p) - compute the eigenvalues of a symmetric tridiagonal matrix T sstedc sstedc (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method sstein sstein (3p) - compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration ssteqr ssteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method ssterf ssterf (3p) - compute all eigenvalues of a symmetric tridiagonal matrix using the Pal-Walker-Kahan variant of the QL or QR algorithm sstev sstev (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A sstevd sstevd (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix sstevx sstevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A sstsv sstsv (3p) - compute the solution to a system of linear equations A * X = B where A is a symmetric tridiagonal matrix ssttrf ssttrf (3p) - compute the factorization of a symmetric tridiagonal matrix A ssttrs ssttrs (3p) - computes the solution to a real system of linear equations A * X = B ssvdc ssvdc (3p) - compute the singular value decomposition of a general matrix A. sswap sswap (3p) - Exchange vectors x and y. ssycon ssycon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF ssyev ssyev (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A ssyevd ssyevd (3p) - compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A ssyevx ssyevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A ssygs2 ssygs2 (3p) - reduce a real symmetric-definite generalized eigenproblem to standard form ssygst ssygst (3p) - reduce a real symmetric-definite generalized eigenproblem to standard form ssygv ssygv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x ssymm ssymm (3p) - perform one of the matrix-matrix operations C := alpha*A*B + beta*C or C := alpha*B*A + beta*C ssymv ssymv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y ssyr ssyr (3p) - perform the symmetric rank 1 operation A := alpha*x*x' + A ssyr2 ssyr2 (3p) - perform the symmetric rank 2 operation A := alpha*x*y' + alpha*y*x' + A ssyr2k ssyr2k (3p) - perform one of the symmetric rank 2k operations C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C ssyrfs ssyrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution ssyrk ssyrk (3p) - perform one of the symmetric rank k operations C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C ssysv ssysv (3p) - compute the solution to a real system of linear equations A * X = B, ssysvx ssysvx (3p) - use the diagonal pivoting factorization to compute the solution to a real system of linear equations A * X = B, ssytd2 ssytd2 (3p) - reduce a real symmetric matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation ssytf2 ssytf2 (3p) - compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method ssytrd ssytrd (3p) - reduce a real symmetric matrix A to real symmetric tridiagonal form T by an orthogonal similarity transformation ssytrf ssytrf (3p) - compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method ssytri ssytri (3p) - compute the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF ssytrs ssytrs (3p) - solve a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF stable_partition stable_partition (3c++/3) - Places all of the entities that satisfy the given predicate before all of the entities that do not, while maintaining the relative order of elements in each group. stable_sort stable_sort (3c++/3) - A templatized algorithm for sorting collections of entities. stack stack (3c++/3) - A container adapter that behaves like a stack (last in, first out). standard_arithmetic ieee_sun (3m) - miscellaneous functions for IEEE arithmetic stat stat (3f) - get file status stat64 stat64 (3f) - get file status for long files stbcon stbcon (3p) - estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm stbmv stbmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x stbrfs stbrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix stbsv stbsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b stbtrs stbtrs (3p) - solve a triangular system of the form A * X = B or A**T * X = B, stdiobuf stdiobuf (3) - buffer and stream classes for use with C stdio stgevc stgevc (3p) - compute some or all of the right and/or left generalized eigenvectors of a pair of real upper triangular matrices (A,B) stgsja stgsja (3p) - compute the generalized singular value decomposition (GSVD) of two real upper triangular (or trapezoidal) matrices A and B stpcon stpcon (3p) - estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm stpmv stpmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x stprfs stprfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix stpsv stpsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b stptri stptri (3p) - compute the inverse of a real upper or lower triangular matrix A stored in packed format stptrs stptrs (3p) - solve a triangular system of the form A * X = B or A**T * X = B, strans strans (3p) - transpose and scale source matrix .HP 1i SUBROUTINE STRANS(PLACE, SCALE, SOURCE, N1, N2, DEST) .HP 1i CHARACTER*1 PLACE .HP 1i INTEGER N1, N2 .HP 1i REAL SCALE, SOURCE(N1, N2), DEST(N2, N1) .HP 1i .HP 1i #include .HP 1i void strans(char place, float scale, float *source, int n1, int n2, float *dest) ; strco strco (3p) - estimate the condition number of a triangular matrix A. It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A. strcon strcon (3p) - estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm strdi strdi (3p) - compute the determinant and inverse of a triangular matrix A. stream_MT stream_MT (3cc4/3) - base class to provide dynamic changing of iostream class objects to and from MT safety. stream_locker stream_locker (3cc4/3) - class used for application level locking of iostream class objects. strevc strevc (3p) - compute some or all of the right and/or left eigenvectors of a real upper quasi-triangular matrix T strexc strexc (3p) - reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that the diagonal block of T with row index IFST is moved to row ILST string string (3c++/3) - A typedef for: basic_string, allocator> For more information about strings, see the entry basic_string. strmm strmm (3p) - perform one of the matrix-matrix operations B := alpha*op( A )*B, or B := alpha*B*op( A ) strmv strmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x strrfs strrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix strsen strsen (3p) - reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix T, strsl strsl (3p) - solve the linear system Ax = b for a triangular matrix A and vectors b and x. strsm strsm (3p) - solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B strsna strsna (3p) - estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a real upper quasi-triangular matrix T (or of any matrix Q*T*Q**T with Q orthogonal) strstream strstream (3) - stream class for ``I/O'' using character arrays strstream strstream (3c++/3) - Reads and writes to an array in memory. strstreambuf strstreambuf (3c++/3) - Associates either the input sequence or the output sequence with a tiny character array whose elements store arbitrary values. strsv strsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b strsyl strsyl (3p) - solve the real Sylvester matrix equation strti2 strti2 (3p) - compute the inverse of a real upper or lower triangular matrix strtri strtri (3p) - compute the inverse of a real upper or lower triangular matrix A strtrs strtrs (3p) - solve a triangular system of the form A * X = B or A**T * X = B, stzrqf stzrqf (3p) - reduce the M-by-N ( M<=N ) real upper trapezoidal matrix A to upper triangular form by means of orthogonal transformations swap swap (3c++/3) - Exchanges values. swap_ranges swap_ranges (3c++/3) - Exchanges a range of values in one location with those in another. swiener swiener (3p) - perform Wiener deconvolution of two signals symlnk link (3f) - make a link to an existing file system system (3f) - execute operating system command tand trig_sun (3m) - more trigonometric functions tanp trig_sun (3m) - more trigonometric functions tanpi trig_sun (3m) - more trigonometric functions task task (3) - coroutines in the C++ task library task.intro task.intro (3) - introduction to the coroutine library and man pages tasksim tasksim (3) - histogram and random numbers for the task library tclose topen (3f) - FORTRAN tape I/O tcov tcov (1) - source code test coverage analysis and statement-by-statement profile teamware teamware (1) - teamware is a graphical user interface (GUI) tool for CodeManager commands. time time (3f) - return system time time_get time_get (3c++/3) - A time formatting facet for input. time_get_byname time_get_byname (3c++/3) - A time formatting facet for input, based on the named locales. time_put time_put (3c++/3) - A time formatting facet for output. time_put_byname time_put_byname (3c++/3) - A facet that includes formatted time output facilities based on the named locales. tolower tolower (3c++/3) - Converts a character to lower case. topen topen (3f) - FORTRAN tape I/O toupper toupper (3c++/3) - Converts a character to upper case. transform transform (3c++/3) - Applies an operation to a range of values in a collection and stores the result. tread topen (3f) - FORTRAN tape I/O trewin topen (3f) - FORTRAN tape I/O trig_sun trig_sun (3m) - more trigonometric functions tskipf topen (3f) - FORTRAN tape I/O tstate topen (3f) - FORTRAN tape I/O ttynam ttynam (3f) - find name of terminal port; also: is unit a terminal? twbuild twbuild (1) - twbuild is a graphical user interface (GUI) tool for Sun WorkShop TeamWare Building commands. twconfig teamware (1) - teamware is a graphical user interface (GUI) tool for CodeManager commands. twfreeze twfreeze (1) - generate or translate SCCS Mergeable delta IDs for lists of files twmerge twmerge (1) - twmerge is a window-based file comparison and merging program twrite topen (3f) - FORTRAN tape I/O twversion twversion (1) - twversion is a graphical user interface (GUI) tool for the Source Code Control System (SCCS). twversion is available as part of the Sun WorkShop TeamWare product. uil2xd uil2xd (1) - Converts UIL source to WorkShop Visual save files unary_function unary_function (3c++/3) - A base class for creating unary function objects. unary_negate unary_negate (3c++/3) - A function object that returns the complement of the result of its unary predicate uninitialized_copy uninitialized_copy (3c++/3) - An algorithm that uses construct to copy values from one range to another location. uninitialized_fill uninitialized_fill (3c++/3) - An algorithm that uses the construct algorithm for setting values in a collection. uninitialized_fill_n uninitialized_fill_n (3c++/3) - An algorithm that uses the construct algorithm for setting values in a collection. unique unique (3c++/3) - Removes consecutive duplicates from a range of values and places the resulting unique values into the result. unique_copy unique (3c++/3) - Removes consecutive duplicates from a range of values and places the resulting unique values into the result. unlink unlink (3f) - remove a file upper_bound upper_bound (3c++/3) - Determines the last valid position for a value in a sorted container. use_double_workspace use_double_workspace (3p) - Provide a block of memory to be used in LAPACK routines that have a real or complex workspace parameter that can vary in length and are called through the C interfaces. use_facet use_facet (3c++/3) - A template function used to obtain a facet. use_int_workspace use_int_workspace (3p) - Provide a block of memory to be used in LAPACK routines that have a integer workspace parameter that can vary in length and are called through the C interfaces. use_threads use_threads (3p) - set the upper bound on the number of threads that the calling thread wants used .HP 1i SUBROUTINE USE_THREADS(NTHREADS) .HP 1i INTEGER NTHREADS .HP 1i .HP 1i #include .HP 1i void use_threads(int nthreads) ; use_workspace use_workspace (3p) - Provide a block of memory to be used in LAPACK routines that have a real or complex workspace parameter that can vary in length and are called through the C interfaces. using_threads using_threads (3p) - returns the current Use number set by the USE_THREADS subroutine .HP 1i INTEGER FUNCTION USING_THREADS() .HP 1i .HP 1i #include .HP 1i int using_threads(void) ; valarray valarray (3c++/3) - An optimized array class for numeric operations. vcfftb vcfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vcfftf vcfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vcffti vcffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. vcosqb vcosqb (3p) - synthesize a Fourier sequence from its representation in terms of a cosine series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. vcosqf vcosqf (3p) - compute the Fourier coefficients in a cosine series representation with only odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. vcosqi vcosqi (3p) - initialize the array xWSAVE, which is used in both xCOSQF and xCOSQB. vcost vcost (3p) - compute the discrete Fourier cosine transform of an even sequence. The xCOST transforms are unnormalized inverses of themselves, so a call of xCOST followed by another call of xCOST will multiply the input sequence by 2 * (N-1). The VxCOST transforms are normalized, so a call of VxCOST followed by a call of VxCOST will return the original sequence. vcosti vcosti (3p) - initialize the array xWSAVE, which is used in xCOST. vdcosqb vdcosqb (3p) - synthesize a Fourier sequence from its representation in terms of a cosine series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. vdcosqf vdcosqf (3p) - compute the Fourier coefficients in a cosine series representation with only odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call to xCOSQB will multiply the input sequence by 4 * N. The VxCOSQ operations are normalized, so a call of VxCOSQF followed by a call of VxCOSQB will return the original sequence. vdcosqi vdcosqi (3p) - initialize the array xWSAVE, which is used in both xCOSQF and xCOSQB. vdcost vdcost (3p) - compute the discrete Fourier cosine transform of an even sequence. The xCOST transforms are unnormalized inverses of themselves, so a call of xCOST followed by another call of xCOST will multiply the input sequence by 2 * (N-1). The VxCOST transforms are normalized, so a call of VxCOST followed by a call of VxCOST will return the original sequence. vdcosti vdcosti (3p) - initialize the array xWSAVE, which is used in xCOST. vdfftb vdfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vdfftf vdfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vdffti vdffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. vdsinqb vdsinqb (3p) - synthesize a Fourier sequence from its representation in terms of a sine series with odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. vdsinqf vdsinqf (3p) - compute the Fourier coefficients in a sine series representation with only odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. vdsinqi vdsinqi (3p) - initialize the array xWSAVE, which is used in both xSINQF and xSINQB. vdsint vdsint (3p) - compute the discrete Fourier sine transform of an odd sequence. The xSINT transforms are unnormalized inverses of themselves, so a call of xSINT followed by another call of xSINT will multiply the input sequence by 2 * (N+1). The VxSINT transforms are normalized, so a call of VxSINT followed by a call of VxSINT will return the original sequence. vdsinti vdsinti (3p) - initialize the array xWSAVE, which is used in subroutine xSINT. vector vector (3c++/3) - A sequence that supports random access iterators. version version (1) - display version identification of object file or binary vertool twversion (1) - twversion is a graphical user interface (GUI) tool for the Source Code Control System (SCCS). twversion is available as part of the Sun WorkShop TeamWare product. visu visu (1) - OSF/Motif user interface builder visu_capture visu_capture (1) - captures user interface design from a running Motif/Xt application \& visu_record visu_record (1) - record user actions from a Motif/Xt program \& visu_replay visu_replay (1) - simulate user input for Motif/Xt program \& visutosj visutosj (1) - convert visu MFC code before transfer to PC vrfftb vrfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vrfftf vrfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vrffti vrffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. vsinqb vsinqb (3p) - synthesize a Fourier sequence from its representation in terms of a sine series with odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. vsinqf vsinqf (3p) - compute the Fourier coefficients in a sine series representation with only odd wave numbers. The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N. The VxSINQ operations are normalized, so a call of VxSINQF followed by a call of VxSINQB will return the original sequence. vsinqi vsinqi (3p) - initialize the array xWSAVE, which is used in both xSINQF and xSINQB. vsint vsint (3p) - compute the discrete Fourier sine transform of an odd sequence. The xSINT transforms are unnormalized inverses of themselves, so a call of xSINT followed by another call of xSINT will multiply the input sequence by 2 * (N+1). The VxSINT transforms are normalized, so a call of VxSINT followed by a call of VxSINT will return the original sequence. vsinti vsinti (3p) - initialize the array xWSAVE, which is used in subroutine xSINT. vzfftb vzfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vzfftf vzfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. vzffti vzffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. wait wait (3f) - wait for a process to terminate wcerr wcerr (3c++/3) - Controls output to an unbuffered stream buffer associated with the object stderr declared in . wcin wcin (3c++/3) - Controls input from a stream buffer associated with the object stdin declared in . wclog wclog (3c++/3) - Controls output to a stream buffer associated with the object stderr declared in . wcout wcout (3c++/3) - Controls output to a stream buffer associated with the object stdout declared in . workshop workshop (1) - An Integrated Programming Environment workspace workspace (1) - manipulate TeamWare workspaces ws_undo ws_undo (1) - undo the effects of the last bringover or putback command wstring wstring (3c++/3) - A typedef for: .br .br basic_string, .br allocator > For more information about strings, see the entry basic_string. xemacs xemacs (1) - Emacs: The Next Generation xerbla xerbla (3p) - error handler for the LAPACK routines zaxpy zaxpy (3p) - Compute y := alpha * x + y zbdsqr zbdsqr (3p) - compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B zchdc zchdc (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. zchdd zchdd (3p) - downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. zchex zchex (3p) - compute the Cholesky decomposition of a symmetric positive definite matrix A. zchud zchud (3p) - update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition. zcnvcor zcnvcor (3p) - compute the convolution or correlation of double precision complex vectors .HP 1i SUBROUTINE ZCNVCOR (CNVCOR, FOUR, NX, X, IFX, INCX, NY, NPRE, M, Y, IFY, INC1Y, INC2Y, NZ, K, Z, IFZ, INC1Z, INC2Z, WORK, LWORK) .HP 1i CHARACTER CNVCOR, FOUR .HP 1i INTEGER IFX, IFY, IFZ, INCX, INC1Y, INC2Y, INC1Z, INC2Z, K, LWORK, NPRE, NX, NY, M, NZ .HP 1i DOUBLE COMPLEX X(*), Y(*), Z(*) .HP 1i DOUBLE COMPLEX WORK(*) .HP 1i .HP 1i .HP 1i #include .HP 1i void zcnvcor(char cnvcor, char four, int nx, doublecomplex *x, int ifx, int incx, int ny, int npre, int m, doublecomplex *y, int ify, int inc1y, int inc2y, int nz, int k, doublecomplex *z, int ifz, int inc1z, int inc2z, doublecomplex *work, int lwork); zcnvcor2 zcnvcor2 (3p) - compute the convolution or correlation of complex matrices .HP 1i SUBROUTINE ZCNVCOR2 (CNVCOR, METHOD, TRANSX, SCRATCHX, TRANSY, SCRATCHY, MX, NX, X, LDX, MY, NY, MPRE, NPRE, Y, LDY, MZ, NZ, Z, LDZ, WORK, LWORK) .HP 1i CHARACTER CNVCOR, METHOD, SCRATCHX, SCRATCHY, TRANSX, TRANSY .HP 1i INTEGER LDX, LDY, LDZ, LWORK, MPRE, MX, MY, MZ, NPRE, NX, NY, NZ .HP 1i DOUBLE COMPLEX WORK(*), X(*), Y(*), Z(*) .HP 1i .HP 1i .HP 1i #include .HP 1i void zcnvcor2(char cnvcor, char method, char transx, char scratchx, char transy, char scratchy, int mx, int nx, doublecomplex *x, int ldx, int my, int ny, int mpre, int npre, doublecomplex *y, int ldy, int mz, int nz, doublecomplex *z, int ldz, doublecomplex *workin, int lwork); zcopy zcopy (3p) - Copy x to y zdotc zdotc (3p) - Compute the dot product of two vectors x and conjg(y). zdotu zdotu (3p) - Compute the dot product of two vectors x and y. zdrot zdrot (3p) - Apply a plane rotation zdrscl zdrscl (3p) - multiply an n-element complex vector x by the real scalar 1/a zdscal zdscal (3p) - Compute y := alpha * y zfft2b zfft2b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. zfft2f zfft2f (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N. zfft2i zfft2i (3p) - initialize the array xWSAVE, which is used in both xFFT2F and xFFT2B. zfft3b zfft3b (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. zfft3f zfft3f (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFT3F followed by a call of xFFT3B will multiply the input sequence by M*N*K. zfft3i zfft3i (3p) - initialize the array xWSAVE, which is used in both xFFT3F and xFFT3B. zfftb zfftb (3p) - compute a periodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. zfftf zfftf (3p) - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N. The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence. zffti zffti (3p) - initialize the array xWSAVE, which is used in both xFFTF and xFFTB. zfftopt zfftopt (3p) - compute the length of the closest fast FFT .HP 1i INTEGER FUNCTION ZFFTOPT(N) .HP 1i INTEGER N .HP 1i .HP 1i .HP 1i #include .HP 1i int zfftopt(int len); zgbbrd zgbbrd (3p) - reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation zgbco zgbco (3p) - compute the LU factorization and condition number of a general matrix A in banded storage. If the condition number is not needed then xGBFA is slightly faster. It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. zgbcon zgbcon (3p) - estimate the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm, zgbdi zgbdi (3p) - compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA. zgbequ zgbequ (3p) - compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number zgbfa zgbfa (3p) - compute the LU factorization of a matrix A in banded storage. It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A. zgbmv zgbmv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or y := alpha*conjg( A' )*x + beta*y zgbrfs zgbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution zgbsl zgbsl (3p) - solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x. zgbsv zgbsv (3p) - compute the solution to a complex system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices zgbsvx zgbsvx (3p) - use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B, zgbtf2 zgbtf2 (3p) - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges zgbtrf zgbtrf (3p) - compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges zgbtrs zgbtrs (3p) - solve a system of linear equations A * X = B, A**T * X = B, or A**H * X = B with a general band matrix A using the LU factorization computed by ZGBTRF zgebak zgebak (3p) - form the right or left eigenvectors of a complex general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by ZGEBAL zgebal zgebal (3p) - balance a general complex matrix A zgebd2 zgebd2 (3p) - reduce a complex general m by n matrix A to upper or lower real bidiagonal form B by a unitary transformation zgebrd zgebrd (3p) - reduce a general complex M-by-N matrix A to upper or lower bidiagonal form B by a unitary transformation zgeco zgeco (3p) - compute the LU factorization and estimate the condition number of a general matrix A. If the condition number is not needed then xGEFA is slightly faster. It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A. zgecon zgecon (3p) - estimate the reciprocal of the condition number of a general complex matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by ZGETRF zgedi zgedi (3p) - compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA. zgeequ zgeequ (3p) - compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number zgees zgees (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z zgeesx zgeesx (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z zgeev zgeev (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors zgeevx zgeevx (3p) - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors zgefa zgefa (3p) - compute the LU factorization of a general matrix A. It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A. zgegs zgegs (3p) - compute for a pair of N-by-N complex nonsymmetric matrices A, zgegv zgegv (3p) - compute for a pair of N-by-N complex nonsymmetric matrices A and B, the generalized eigenvalues (alpha, beta), and optionally, zgehd2 zgehd2 (3p) - reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation zgehrd zgehrd (3p) - reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation zgelq2 zgelq2 (3p) - compute an LQ factorization of a complex m by n matrix A zgelqf zgelqf (3p) - compute an LQ factorization of a complex M-by-N matrix A zgels zgels (3p) - solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix A, or its conjugate-transpose, using a QR or LQ factorization of A zgelss zgelss (3p) - compute the minimum norm solution to a complex linear least squares problem zgelsx zgelsx (3p) - compute the minimum-norm solution to a complex linear least squares problem zgemm zgemm (3p) - perform one of the matrix-matrix operations C := alpha*op( A )*op( B ) + beta*C zgemv zgemv (3p) - perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or y := alpha*conjg( A' )*x + beta*y zgeql2 zgeql2 (3p) - compute a QL factorization of a complex m by n matrix A zgeqlf zgeqlf (3p) - compute a QL factorization of a complex M-by-N matrix A zgeqpf zgeqpf (3p) - compute a QR factorization with column pivoting of a complex M-by-N matrix A zgeqr2 zgeqr2 (3p) - compute a QR factorization of a complex m by n matrix A zgeqrf zgeqrf (3p) - compute a QR factorization of a complex M-by-N matrix A zgerc zgerc (3p) - perform the rank 1 operation A := alpha*x*conjg( y' ) + A zgerfs zgerfs (3p) - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution zgerq2 zgerq2 (3p) - compute an RQ factorization of a complex m by n matrix A zgerqf zgerqf (3p) - compute an RQ factorization of a complex M-by-N matrix A zgeru zgeru (3p) - perform the rank 1 operation A := alpha*x*y' + A zgesl zgesl (3p) - solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x. zgesv zgesv (3p) - compute the solution to a complex system of linear equations A * X = B, zgesvd zgesvd (3p) - compute the singular value decomposition (SVD) of a complex M-by-N matrix A, optionally computing the left and/or right singular vectors zgesvx zgesvx (3p) - use the LU factorization to compute the solution to a complex system of linear equations A * X = B, zgetf2 zgetf2 (3p) - compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges zgetrf zgetrf (3p) - compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges zgetri zgetri (3p) - compute the inverse of a matrix using the LU factorization computed by ZGETRF zgetrs zgetrs (3p) - solve a system of linear equations A * X = B, A**T * X = B, or A**H * X = B with a general N-by-N matrix A using the LU factorization computed by ZGETRF zggbak zggbak (3p) - form the right or left eigenvectors of a complex generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by ZGGBAL zggbal zggbal (3p) - balance a pair of general complex matrices (A,B) zggglm zggglm (3p) - solve a general Gauss-Markov linear model (GLM) problem zgghrd zgghrd (3p) - reduce a pair of complex matrices (A,B) to generalized upper Hessenberg form using unitary transformations, where A is a general matrix and B is upper triangular zgglse zgglse (3p) - solve the linear equality-constrained least squares (LSE) problem zggqrf zggqrf (3p) - compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B zggrqf zggrqf (3p) - compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B zggsvd zggsvd (3p) - compute the generalized singular value decomposition (GSVD) of an M-by-N complex matrix A and P-by-N complex matrix B zggsvp zggsvp (3p) - compute unitary matrices U, V and Q such that N-K-L K L U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0 zgtcon zgtcon (3p) - estimate the reciprocal of the condition number of a complex tridiagonal matrix A using the LU factorization as computed by ZGTTRF zgtrfs zgtrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution zgtsl zgtsl (3p) - solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x. zgtsv zgtsv (3p) - solve the equation A*X = B, zgtsvx zgtsvx (3p) - use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B, zgttrf zgttrf (3p) - compute an LU factorization of a complex tridiagonal matrix A using elimination with partial pivoting and row interchanges zgttrs zgttrs (3p) - solve one of the systems of equations A * X = B, A**T * X = B, or A**H * X = B, zhbev zhbev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A zhbevd zhbevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A zhbevx zhbevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A zhbgst zhbgst (3p) - reduce a complex Hermitian-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, zhbgv zhbgv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x zhbmv zhbmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y zhbtrd zhbtrd (3p) - reduce a complex Hermitian band matrix A to real symmetric tridiagonal form T by a unitary similarity transformation zhecon zhecon (3p) - estimate the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF zheev zheev (3p) - compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A zheevd zheevd (3p) - compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A zheevx zheevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A zhegs2 zhegs2 (3p) - reduce a complex Hermitian-definite generalized eigenproblem to standard form zhegst zhegst (3p) - reduce a complex Hermitian-definite generalized eigenproblem to standard form zhegv zhegv (3p) - compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x zhemm zhemm (3p) - perform one of the matrix-matrix operations C := alpha*A*B + beta*C or C := alpha*B*A + beta*C zhemv zhemv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y zher zher (3p) - perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A zher2 zher2 (3p) - perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A zher2k zher2k (3p) - perform one of the hermitian rank 2k operations C := alpha*A*conjg( B' ) + conjg( alpha )*B*conjg( A' ) + beta*C or C := alpha*conjg( A' )*B + conjg( alpha )*conjg( B' )*A + beta*C zherfs zherfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates for the solution zherk zherk (3p) - perform one of the hermitian rank k operations C := alpha*A*conjg( A' ) + beta*C or C := alpha*conjg( A' )*A + beta*C zhesv zhesv (3p) - compute the solution to a complex system of linear equations A * X = B, zhesvx zhesvx (3p) - use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B, zhetd2 zhetd2 (3p) - reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation zhetf2 zhetf2 (3p) - compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method zhetrd zhetrd (3p) - reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation zhetrf zhetrf (3p) - compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method zhetri zhetri (3p) - compute the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF zhetrs zhetrs (3p) - solve a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF zhgeqz zhgeqz (3p) - implement a single-shift version of the QZ method for finding the generalized eigenvalues w(i)=ALPHA(i)/BETA(i) of the equation det( A-w(i) B ) = 0 If JOB='S', then the pair (A,B) is simultaneously reduced to Schur form (i.e., A and B are both upper triangular) by applying one unitary tranformation (usually called Q) on the left and another (usually called Z) on the right zhico zhico (3p) - compute the UDU factorization and condition number of a Hermitian matrix A. If the condition number is not needed then xHIFA is slightly faster. It is typical to follow a call to xHICO with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A. zhidi zhidi (3p) - compute the determinant, inertia, and inverse of a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA. zhifa zhifa (3p) - compute the UDU factorization of a Hermitian matrix A. It is typical to follow a call to xHIFA with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A. zhisl zhisl (3p) - solve the linear system Ax = b for a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA, and vectors b and x. zhpco zhpco (3p) - compute the UDU factorization and condition number of a Hermitian matrix A in packed storage. If the condition number is not needed then xHPFA is slightly faster. It is typical to follow a call to xHPCO with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A. zhpcon zhpcon (3p) - estimate the reciprocal of the condition number of a complex Hermitian packed matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF zhpdi zhpdi (3p) - compute the determinant, inertia, and inverse of a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA. zhpev zhpev (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage zhpevd zhpevd (3p) - compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage zhpevx zhpevx (3p) - compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage zhpfa zhpfa (3p) - compute the UDU factorization of a Hermitian matrix A in packed storage. It is typical to follow a call to xHPFA with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A. zhpgst zhpgst (3p) - reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage zhpgv zhpgv (3p) - compute all the eigenvalues and, optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x zhpmv zhpmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y zhpr zhpr (3p) - perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A zhpr2 zhpr2 (3p) - perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A zhprfs zhprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite and packed, and provides error bounds and backward error estimates for the solution zhpsl zhpsl (3p) - solve the linear system Ax = b for a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA, and vectors b and x. zhpsv zhpsv (3p) - compute the solution to a complex system of linear equations A * X = B, zhpsvx zhpsvx (3p) - use the diagonal pivoting factorization A = U*D*U**H or A = L*D*L**H to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian matrix stored in packed format and X and B are N-by-NRHS matrices zhptrd zhptrd (3p) - reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation zhptrf zhptrf (3p) - compute the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method zhptri zhptri (3p) - compute the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF zhptrs zhptrs (3p) - solve a system of linear equations A*X = B with a complex Hermitian matrix A stored in packed format using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF zhsein zhsein (3p) - use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H zhseqr zhseqr (3p) - compute the eigenvalues of a complex upper Hessenberg matrix H, and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**H, where T is an upper triangular matrix (the Schur form), and Z is the unitary matrix of Schur vectors zlabrd zlabrd (3p) - reduce the first NB rows and columns of a complex general m by n matrix A to upper or lower real bidiagonal form by a unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A zlacgv zlacgv (3p) - conjugate a complex vector of length N zlacon zlacon (3p) - estimate the 1-norm of a square, complex matrix A zlacpy zlacpy (3p) - copie all or part of a two-dimensional matrix A to another matrix B zlacrm zlacrm (3p) - perform a very simple matrix-matrix multiplication zlacrt zlacrt (3p) - apply a plane rotation, where the cos and sin (C and S) are complex and the vectors CX and CY are complex zladiv zladiv (3p) - := X / Y, where X and Y are complex zlaed0 zlaed0 (3p) - the divide and conquer method, ZLAED0 computes all eigenvalues of a symmetric tridiagonal matrix which is one diagonal block of those from reducing a dense or band Hermitian matrix and corresponding eigenvectors of the dense or band matrix zlaed7 zlaed7 (3p) - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix zlaed8 zlaed8 (3p) - merge the two sets of eigenvalues together into a single sorted set zlaein zlaein (3p) - use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H zlaesy zlaesy (3p) - compute the eigendecomposition of a 2-by-2 symmetric matrix ( ( A, B );( B, C ) ) provided the norm of the matrix of eigenvectors is larger than some threshold value zlaev2 zlaev2 (3p) - compute the eigendecomposition of a 2-by-2 Hermitian matrix [ A B ] [ CONJG(B) C ] zlags2 zlags2 (3p) - compute 2-by-2 unitary matrices U, V and Q, such that if ( UPPER ) then U'*A*Q = U'*( A1 A2 )*Q = ( x 0 ) ( 0 A3 ) ( x x ) and V'*B*Q = V'*( B1 B2 )*Q = ( x 0 ) ( 0 B3 ) ( x x ) or if ( .NOT.UPPER ) then U'*A*Q = U'*( A1 0 )*Q = ( x x ) ( A2 A3 ) ( 0 x ) and V'*B*Q = V'*( B1 0 )*Q = ( x x ) ( B2 B3 ) ( 0 x ) where U = ( CSU SNU ), V = ( CSV SNV ), zlagtm zlagtm (3p) - perform a matrix-vector product of the form B := alpha * A * X + beta * B where A is a tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta are real scalars, each of which may be zero, one, or minus one zlahef zlahef (3p) - compute a partial factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method zlahqr zlahqr (3p) - i an auxiliary routine called by ZHSEQR to update the eigenvalues and Schur decomposition already computed by ZHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI zlahrd zlahrd (3p) - reduce the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero zlaic1 zlaic1 (3p) - apply one step of incremental condition estimation in its simplest version zlangb zlangb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals zlange zlange (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex matrix A zlangt zlangt (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex tridiagonal matrix A zlanhb zlanhb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n hermitian band matrix A, with k super-diagonals zlanhe zlanhe (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A zlanhp zlanhp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A, supplied in packed form zlanhs zlanhs (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A zlanht zlanht (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex Hermitian tridiagonal matrix A zlansb zlansb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals zlansp zlansp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A, supplied in packed form zlansy zlansy (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A zlantb zlantb (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals zlantp zlantp (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form zlantr zlantr (3p) - return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A zlapll zlapll (3p) - two column vectors X and Y, let A = ( X Y ) zlapmt zlapmt (3p) - rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N zlaqgb zlaqgb (3p) - equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C zlaqge zlaqge (3p) - equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C zlaqhb zlaqhb (3p) - equilibrate a symmetric band matrix A using the scaling factors in the vector S zlaqhe zlaqhe (3p) - equilibrate a Hermitian matrix A using the scaling factors in the vector S zlaqhp zlaqhp (3p) - equilibrate a Hermitian matrix A using the scaling factors in the vector S zlaqsb zlaqsb (3p) - equilibrate a symmetric band matrix A using the scaling factors in the vector S zlaqsp zlaqsp (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S zlaqsy zlaqsy (3p) - equilibrate a symmetric matrix A using the scaling factors in the vector S zlar2v zlar2v (3p) - apply a vector of complex plane rotations with real cosines from both sides to a sequence of 2-by-2 complex Hermitian matrices, zlarf zlarf (3p) - apply a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right zlarfb zlarfb (3p) - apply a complex block reflector H or its transpose H' to a complex M-by-N matrix C, from either the left or the right zlarfg zlarfg (3p) - generate a complex elementary reflector H of order n, such that H' * ( alpha ) = ( beta ), H' * H = I zlarft zlarft (3p) - form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors zlarfx zlarfx (3p) - apply a complex elementary reflector H to a complex m by n matrix C, from either the left or the right zlargv zlargv (3p) - generate a vector of complex plane rotations with real cosines, determined by elements of the complex vectors x and y zlarnv zlarnv (3p) - return a vector of n random complex numbers from a uniform or normal distribution zlartg zlartg (3p) - generate a plane rotation so that [ CS SN ] [ F ] [ R ] [ __ ] zlartv zlartv (3p) - apply a vector of complex plane rotations with real cosines to elements of the complex vectors x and y zlascl zlascl (3p) - multiply the M by N complex matrix A by the real scalar CTO/CFROM zlaset zlaset (3p) - initialize a 2-D array A to BETA on the diagonal and ALPHA on the offdiagonals zlasr zlasr (3p) - perform the transformation A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) where A is an m by n complex matrix and P is an orthogonal matrix, zlassq zlassq (3p) - return the values scl and ssq such that ( scl**2 )*ssq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, zlaswp zlaswp (3p) - perform a series of row interchanges on the matrix A zlasyf zlasyf (3p) - compute a partial factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method zlatbs zlatbs (3p) - solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b, zlatps zlatps (3p) - solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b, zlatrd zlatrd (3p) - reduce NB rows and columns of a complex Hermitian matrix A to Hermitian tridiagonal form by a unitary similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A zlatrs zlatrs (3p) - solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b, zlatzm zlatzm (3p) - apply a Householder matrix generated by ZTZRQF to a matrix zlauu2 zlauu2 (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A zlauum zlauum (3p) - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A zoptimal_workspace zoptimal_workspace (3p) - Get the optimal amount of workspace for the last routine called that supports varying length .HP 1i .HP 1i #include .HP 1i double complex workspace. zpbco zpbco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage. If the condition number is not needed then xPBFA is slightly faster. It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. zpbcon zpbcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite band matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPBTRF zpbdi zpbdi (3p) - compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA. zpbequ zpbequ (3p) - compute row and column scalings intended to equilibrate a Hermitian positive definite band matrix A and reduce its condition number (with respect to the two-norm) zpbfa zpbfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage. It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A. zpbrfs zpbrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and banded, and provides error bounds and backward error estimates for the solution zpbsl zpbsl (3p) - section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x. zpbstf zpbstf (3p) - compute a split Cholesky factorization of a complex Hermitian positive definite band matrix A zpbsv zpbsv (3p) - compute the solution to a complex system of linear equations A * X = B, zpbsvx zpbsvx (3p) - use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B, zpbtf2 zpbtf2 (3p) - compute the Cholesky factorization of a complex Hermitian positive definite band matrix A zpbtrf zpbtrf (3p) - compute the Cholesky factorization of a complex Hermitian positive definite band matrix A zpbtrs zpbtrs (3p) - solve a system of linear equations A*X = B with a Hermitian positive definite band matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPBTRF zpoco zpoco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A. If the condition number is not needed then xPOFA is slightly faster. It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. zpocon zpocon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPOTRF zpodi zpodi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC. zpoequ zpoequ (3p) - compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the two-norm) zpofa zpofa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A. It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A. zporfs zporfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite, zposl zposl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x. zposv zposv (3p) - compute the solution to a complex system of linear equations A * X = B, zposvx zposvx (3p) - use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B, zpotf2 zpotf2 (3p) - compute the Cholesky factorization of a complex Hermitian positive definite matrix A zpotrf zpotrf (3p) - compute the Cholesky factorization of a complex Hermitian positive definite matrix A zpotri zpotri (3p) - compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPOTRF zpotrs zpotrs (3p) - solve a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPOTRF zppco zppco (3p) - compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage. If the condition number is not needed then xPPFA is slightly faster. It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. zppcon zppcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite packed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF zppdi zppdi (3p) - compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA. zppequ zppequ (3p) - compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm) zppfa zppfa (3p) - compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage. It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A. zpprfs zpprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward error estimates for the solution zppsl zppsl (3p) - solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x. zppsv zppsv (3p) - compute the solution to a complex system of linear equations A * X = B, zppsvx zppsvx (3p) - use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B, zpptrf zpptrf (3p) - compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format zpptri zpptri (3p) - compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF zpptrs zpptrs (3p) - solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF zptcon zptcon (3p) - compute the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by ZPTTRF zpteqr zpteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF and then calling ZBDSQR to compute the singular values of the bidiagonal factor zptrfs zptrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution zptsl zptsl (3p) - solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x. zptsv zptsv (3p) - compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices zptsvx zptsvx (3p) - use the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices zpttrf zpttrf (3p) - compute the factorization of a complex Hermitian positive definite tridiagonal matrix A zpttrs zpttrs (3p) - solve a system of linear equations A * X = B with a Hermitian positive definite tridiagonal matrix A using the factorization A = U**H*D*U or A = L*D*L**H computed by ZPTTRF zqrdc zqrdc (3p) - compute the QR factorization of a general matrix A. It is typical to follow a call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A. zqrsl zqrsl (3p) - solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x. zrot zrot (3p) - apply a plane rotation, where the cos (C) is real and the sin (S) is complex, and the vectors CX and CY are complex zrotg zrotg (3p) - Construct a Given's plane rotation zscal zscal (3p) - Compute y := alpha * y zsico zsico (3p) - compute the UDU factorization and condition number of a symmetric matrix A. If the condition number is not needed then xSIFA is slightly faster. It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. zsidi zsidi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA. zsifa zsifa (3p) - compute the UDU factorization of a symmetric matrix A. It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A. zsisl zsisl (3p) - solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x. zspco zspco (3p) - compute the UDU factorization and condition number of a symmetric matrix A in packed storage. If the condition number is not needed then xSPFA is slightly faster. It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. zspcon zspcon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF zspdi zspdi (3p) - compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA. zspfa zspfa (3p) - compute the UDU factorization of a symmetric matrix A in packed storage. It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A. zspmv zspmv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y, zspr zspr (3p) - perform the symmetric rank 1 operation A := alpha*x*conjg( x' ) + A, zsprfs zsprfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution zspsl zspsl (3p) - solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x. zspsv zspsv (3p) - compute the solution to a complex system of linear equations A * X = B, zspsvx zspsvx (3p) - use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices zsptrf zsptrf (3p) - compute the factorization of a complex symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method zsptri zsptri (3p) - compute the inverse of a complex symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF zsptrs zsptrs (3p) - solve a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF zstedc zstedc (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method zstein zstein (3p) - compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration zsteqr zsteqr (3p) - compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method zstsv zstsv (3p) - compute the solution to a complex system of linear equations A * X = B where A is a Hermitian tridiagonal matrix zsttrf zsttrf (3p) - compute the factorization of a complex Hermitian tridiagonal matrix A zsttrs zsttrs (3p) - computes the solution to a complex*16 system of linear equations A * X = B zsvdc zsvdc (3p) - compute the singular value decomposition of a general matrix A. zswap zswap (3p) - Exchange vectors x and y. zsycon zsycon (3p) - estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSYTRF zsymm zsymm (3p) - perform one of the matrix-matrix operations C := alpha*A*B + beta*C or C := alpha*B*A + beta*C zsymv zsymv (3p) - perform the matrix-vector operation y := alpha*A*x + beta*y, zsyr zsyr (3p) - perform the symmetric rank 1 operation A := alpha*x*( x' ) + A, zsyr2k zsyr2k (3p) - perform one of the symmetric rank 2k operations C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C zsyrfs zsyrfs (3p) - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution zsyrk zsyrk (3p) - perform one of the symmetric rank k operations C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C zsysv zsysv (3p) - compute the solution to a complex system of linear equations A * X = B, zsysvx zsysvx (3p) - use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B, zsytf2 zsytf2 (3p) - compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method zsytrf zsytrf (3p) - compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method zsytri zsytri (3p) - compute the inverse of a complex symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSYTRF zsytrs zsytrs (3p) - solve a system of linear equations A*X = B with a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSYTRF ztbcon ztbcon (3p) - estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm ztbmv ztbmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x ztbrfs ztbrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix ztbsv ztbsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b ztbtrs ztbtrs (3p) - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B, ztgevc ztgevc (3p) - compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B) ztgsja ztgsja (3p) - compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B ztpcon ztpcon (3p) - estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm ztpmv ztpmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x ztprfs ztprfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix ztpsv ztpsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b ztptri ztptri (3p) - compute the inverse of a complex upper or lower triangular matrix A stored in packed format ztptrs ztptrs (3p) - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B, ztrans ztrans (3p) - transpose and scale source matrix .HP 1i SUBROUTINE ZTRANS(PLACE, SCALE, SOURCE, N1, N2, DEST) .HP 1i CHARACTER*1 PLACE .HP 1i INTEGER N1, N2 .HP 1i COMPLEX*16 SCALE, SOURCE(N1, N2), DEST(N2, N1) .HP 1i .HP 1i #include .HP 1i void ztrans(char place, doublecomplex *scale, doublecomplex *source, int n1, int n2, doublecomplex *dest) ; ztrco ztrco (3p) - estimate the condition number of a triangular matrix A. It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A. ztrcon ztrcon (3p) - estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm ztrdi ztrdi (3p) - compute the determinant and inverse of a triangular matrix A. ztrevc ztrevc (3p) - compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T ztrexc ztrexc (3p) - reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row index IFST is moved to row ILST ztrmm ztrmm (3p) - perform one of the matrix-matrix operations B := alpha*op( A )*B or B := alpha*B*op( A ) where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of op( A ) = A or op( A ) = A' or op( A ) = conjg( A' ) ztrmv ztrmv (3p) - perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x ztrrfs ztrrfs (3p) - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix ztrsen ztrsen (3p) - reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in the leading positions on the diagonal of the upper triangular matrix T, and the leading columns of Q form an orthonormal basis of the corresponding right invariant subspace ztrsl ztrsl (3p) - solve the linear system Ax = b for a triangular matrix A and vectors b and x. ztrsm ztrsm (3p) - solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B ztrsna ztrsna (3p) - estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper triangular matrix T (or of any matrix Q*T*Q**H with Q unitary) ztrsv ztrsv (3p) - solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b ztrsyl ztrsyl (3p) - solve the complex Sylvester matrix equation ztrti2 ztrti2 (3p) - compute the inverse of a complex upper or lower triangular matrix ztrtri ztrtri (3p) - compute the inverse of a complex upper or lower triangular matrix A ztrtrs ztrtrs (3p) - solve a triangular system of the form A * X = B, A**T * X = B, or A**H * X = B, ztzrqf ztzrqf (3p) - reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations zung2l zung2l (3p) - generate an m by n complex matrix Q with orthonormal columns, zung2r zung2r (3p) - generate an m by n complex matrix Q with orthonormal columns, zungbr zungbr (3p) - generate one of the complex unitary matrices Q or P**H determined by ZGEBRD when reducing a complex matrix A to bidiagonal form zunghr zunghr (3p) - generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by ZGEHRD zungl2 zungl2 (3p) - generate an m-by-n complex matrix Q with orthonormal rows, zunglq zunglq (3p) - generate an M-by-N complex matrix Q with orthonormal rows, zungql zungql (3p) - generate an M-by-N complex matrix Q with orthonormal columns, zungqr zungqr (3p) - generate an M-by-N complex matrix Q with orthonormal columns, zungr2 zungr2 (3p) - generate an m by n complex matrix Q with orthonormal rows, zungrq zungrq (3p) - generate an M-by-N complex matrix Q with orthonormal rows, zungtr zungtr (3p) - generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by ZHETRD zunm2l zunm2l (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', zunm2r zunm2r (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', zunmbr zunmbr (3p) - VECT = 'Q', ZUNMBR overwrites the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zunmhr zunmhr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zunml2 zunml2 (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', zunmlq zunmlq (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zunmql zunmql (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zunmqr zunmqr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zunmr2 zunmr2 (3p) - overwrite the general complex m-by-n matrix C with Q * C if SIDE = 'L' and TRANS = 'N', or Q'* C if SIDE = 'L' and TRANS = 'C', or C * Q if SIDE = 'R' and TRANS = 'N', or C * Q' if SIDE = 'R' and TRANS = 'C', zunmrq zunmrq (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zunmtr zunmtr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zupgtr zupgtr (3p) - generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by ZHPTRD using packed storage zupmtr zupmtr (3p) - overwrite the general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N' zvmul zvmul (3p) - compute the scaled product of complex*16 vectors .HP 1i SUBROUTINE ZVMUL(N, ALPHA, X, INCX, Y, INCY, BETA, Z, INCZ) .HP 1i INTEGER N, INCX, INCY, INCZ .HP 1i COMPLEX*16 ALPHA, BETA, X(*), Y(*), Z(*) .HP 1i .HP 1i #include .HP 1i void zvmul(int n, doublecomplex *alpha, doublecomplex *x, int incx, doublecomplex *y, int incy, doublecomplex *beta, doublecomplex *z, int incz) ;