why do inode indices starts from 1 unlike array indexes which starts from 0
its a question from "the design of unix operating system" of maurice j bach
id be glad if i get to know the answer quickly
:) (0 Replies)
brothers why inode index starts from 1 unlike array inex which starts from 0
its a question from the design of unix operating system of maurice j.bach
i need to know the answer urgently...someone help please (1 Reply)
For kicks I wrote up a Password generator after lunch. Let me start with the code:
unsigned int x,y,z,c;
unsigned int KISS();
unsigned int devrand();
int main( int argc, char** argv )
{
int i, j = 1;
char pwd = "abcdefghijklmnopqrstuvwxyz"
... (5 Replies)
Hi,
I've list of files in a directory, which have date stamp value in their names.
ex:
abc_data_20071102.csv,
abc_data_20091221.csv,
abc_data_20100110.csv,
abc_data_20100222.csv,
abc_data_20080620.csv,... etc.,
I need to select and process only files, within the given date... (4 Replies)
Hi
My pipe delimited .txt file contains rows with 10 columns.
Can anyone advise how I output to file only those rows with the letters ‘ci'
as the first 2 characters in the 3rd column ?
Many thanks (4 Replies)
I have two arrays DIST(1:NCOF) and X(1:NX)
Let NCOF = 5 and NX = 15, with
DIST = and
X =
I want to create an array that puts a zero if DIST is outside the region in X, otherwise putting 1.
In this example I should get
RES =
Using DIST = would give RES =
The values in... (6 Replies)
Hi,
I have a file with the following columns:
361459 447394 CHL1
290282 290282 CHL1
361459 447394 CHL1
361459 447394 CHL1
178352861 178363529 AGA
178352861 178363529 AGA
178363657 178363657 AGA
Essentially, using CHL1 as an example. For any line that has CHL1 in... (2 Replies)
Hi,
I am new to perl and I have the following query please help here.
I have following array variables declaration
@pld1 = qw(00 01 02 03 04 05);
@pld2 = qw(10 11 12 13 14 15);
for(my $k=1;$k<=2;$k++)
{
//I want here to use @pld1 if $k is 1
// and @pld2 if $k is 2. How to do... (3 Replies)
Trying to do some control flow parsing based on the index postion of an array member. Here is the pseudo code I am trying to write in (preferably in pure bash) where possible. I am thinking regex with do the trick, but need a little help.
pesudo code
if == ENDSINFIVEINTS ]]; then
do... (4 Replies)
Hello,
I need to find out the minimum and maximum values based on specific column, and then print out the entire row with the max value.
Infile.txt:
scf6 290173 290416 . + X_047241 T_00113118-1
scf6 290491 290957 . + X_047241 T_00113118-2
scf6 290898 290957 . + X_047241 T_00113119-3
scf6... (2 Replies)
Discussion started by: yifangt
2 Replies
LEARN ABOUT DEBIAN
solver
solver(2rheolef) rheolef-6.1 solver(2rheolef)NAME
solver - direct or interative solver interface
DESCRIPTION
The class implements a matrix factorization:
LU factorization for an unsymmetric matrix and
Choleski fatorisation for a symmetric one.
Let a be a square invertible matrix in
csr format (see csr(2)).
csr<Float> a;
We get the factorization by:
solver<Float> sa (a);
Each call to the direct solver for a*x = b writes either:
vec<Float> x = sa.solve(b);
When the matrix is modified in a computation loop but
conserves its sparsity pattern, an efficient re-factorization
writes:
sa.update_values (new_a);
x = sa.solve(b);
This approach skip the long step of the symbolic factization step.
ITERATIVE SOLVER
The factorization can also be incomplete, i.e. a pseudo-inverse,
suitable for preconditionning iterative methods.
In that case, the sa.solve(b) call runs a conjugate gradient
when the matrix is symmetric, or a generalized minimum residual
algorithm when the matrix is unsymmetric.
AUTOMATIC CHOICE AND CUSTOMIZATION
The symmetry of the matrix is tested via the a.is_symmetric() property
(see csr(2)) while the choice between direct or iterative solver
is switched from the a.pattern_dimension() value. When the pattern
is 3D, an iterative method is faster and less memory consuming.
Otherwhise, for 1D or 2D problems, the direct method is prefered.
These default choices can be supersetted by using explicit options:
solver_option_type opt;
opt.iterative = true;
solver<Float> sa (a, opt);
See the solver.h header for the complete list of available options.
IMPLEMENTATION NOTE
The implementation bases on the pastix library.
IMPLEMENTATION
template <class T, class M = rheo_default_memory_model>
class solver_basic : public smart_pointer<solver_rep<T,M> > {
public:
// typedefs:
typedef solver_rep<T,M> rep;
typedef smart_pointer<rep> base;
// allocator:
solver_basic ();
explicit solver_basic (const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
void update_values (const csr<T,M>& a);
// accessors:
vec<T,M> trans_solve (const vec<T,M>& b) const;
vec<T,M> solve (const vec<T,M>& b) const;
};
// factorizations:
template <class T, class M>
solver_basic<T,M> ldlt(const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
template <class T, class M>
solver_basic<T,M> lu (const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
template <class T, class M>
solver_basic<T,M> ic0 (const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
template <class T, class M>
solver_basic<T,M> ilu0(const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
typedef solver_basic<Float> solver;
SEE ALSO csr(2), csr(2)rheolef-6.1 rheolef-6.1 solver(2rheolef)