LUDecomposition::Matrix LUDecomposition::solve (const Matrix& B) const {
BOOST_UBLAS_CHECK((int)B.size1() == m, bad_size("Matrix row dimensions must agree."));
BOOST_UBLAS_CHECK(isNonsingular(), singular("Matrix is singular."));
// Copy right hand side with pivoting
int nx = B.size2();
Matrix X(m,nx);
for (int i = 0; i < m; i++) {
row(X,i) = row(B, piv(i));
}
// Solve L*Y = B(piv,:)
for (int k = 0; k < n; k++) {
for (int i = k+1; i < n; i++) {
for (int j = 0; j < nx; j++) {
X(i,j) -= X(k,j)*LU(i,k);
}
}
}
// Solve U*X = Y;
for (int k = n-1; k >= 0; k--) {
for (int j = 0; j < nx; j++) {
X(k,j) /= LU(k,k);
}
for (int i = 0; i < k; i++) {
for (int j = 0; j < nx; j++) {
X(i,j) -= X(k,j)*LU(i,k);
}
}
}
return X;
}
int
gsl_linalg_complex_LU_refine (const gsl_matrix_complex * A, const gsl_matrix_complex * LU, const gsl_permutation * p, const gsl_vector_complex * b, gsl_vector_complex * x, gsl_vector_complex * residual)
{
if (A->size1 != A->size2)
{
GSL_ERROR ("matrix a must be square", GSL_ENOTSQR);
}
if (LU->size1 != LU->size2)
{
GSL_ERROR ("LU matrix must be square", GSL_ENOTSQR);
}
else if (A->size1 != LU->size2)
{
GSL_ERROR ("LU matrix must be decomposition of a", GSL_ENOTSQR);
}
else if (LU->size1 != p->size)
{
GSL_ERROR ("permutation length must match matrix size", GSL_EBADLEN);
}
else if (LU->size1 != b->size)
{
GSL_ERROR ("matrix size must match b size", GSL_EBADLEN);
}
else if (LU->size1 != x->size)
{
GSL_ERROR ("matrix size must match solution size", GSL_EBADLEN);
}
else if (singular (LU))
{
GSL_ERROR ("matrix is singular", GSL_EDOM);
}
else
{
int status;
/* Compute residual, residual = (A * x - b) */
gsl_vector_complex_memcpy (residual, b);
{
gsl_complex one = GSL_COMPLEX_ONE;
gsl_complex negone = GSL_COMPLEX_NEGONE;
gsl_blas_zgemv (CblasNoTrans, one, A, x, negone, residual);
}
/* Find correction, delta = - (A^-1) * residual, and apply it */
status = gsl_linalg_complex_LU_svx (LU, p, residual);
{
gsl_complex negone= GSL_COMPLEX_NEGONE;
gsl_blas_zaxpy (negone, residual, x);
}
return status;
}
}
bool Foam::SolverPerformance<Type>::checkSingularity
(
const Type& wApA
)
{
for(direction cmpt=0; cmpt<pTraits<Type>::nComponents; cmpt++)
{
singular_[cmpt] =
component(wApA, cmpt) < vsmall_;
}
return singular();
}
Foam::SolverPerformance<typename Foam::pTraits<Type>::cmptType>
Foam::SolverPerformance<Type>::max()
{
return SolverPerformance<typename pTraits<Type>::cmptType>
(
solverName_,
fieldName_,
cmptMax(initialResidual_),
cmptMax(finalResidual_),
cmptMax(nIterations_),
converged_,
singular()
);
}
static void
chest_shatter_msg(struct obj *otmp)
{
const char *disposition;
const char *thing;
long save_Blinded;
if (otmp->oclass == POTION_CLASS) {
pline(msgc_itemloss, "You %s %s shatter!", Blind ? "hear" : "see",
an(bottlename()));
if (!breathless(youmonst.data) || haseyes(youmonst.data))
potionbreathe(&youmonst, otmp);
return;
}
/* We have functions for distant and singular names, but not one
which does _both_...
TODO: fix this blindness kludge (it doesn't even work -- see eoto) */
save_Blinded = property_timeout(&youmonst, BLINDED);
set_property(&youmonst, BLINDED, 1, TRUE);
thing = singular(otmp, xname);
if (save_Blinded)
set_property(&youmonst, BLINDED, save_Blinded, TRUE);
switch (objects[otmp->otyp].oc_material) {
case PAPER:
disposition = "is torn to shreds";
break;
case WAX:
disposition = "is crushed";
break;
case VEGGY:
disposition = "is pulped";
break;
case FLESH:
disposition = "is mashed";
break;
case GLASS:
disposition = "shatters";
break;
case WOOD:
disposition = "splinters to fragments";
break;
default:
disposition = "is destroyed";
break;
}
pline(msgc_itemloss, "%s %s!", An(thing), disposition);
}
bool Foam::SolverPerformance<Type>::operator!=
(
const SolverPerformance<Type>& sp
) const
{
return
(
solverName() != sp.solverName()
|| fieldName() != sp.fieldName()
|| initialResidual() != sp.initialResidual()
|| finalResidual() != sp.finalResidual()
|| nIterations() != sp.nIterations()
|| converged() != sp.converged()
|| singular() != sp.singular()
);
}
void Foam::lduMatrix::solverPerformance::print() const
{
if (debug)
{
Info<< solverName_ << ": Solving for " << fieldName_;
if (singular())
{
Info<< ": solution singularity" << endl;
}
else
{
Info<< ", Initial residual = " << initialResidual_
<< ", Final residual = " << finalResidual_
<< ", No Iterations " << noIterations_
<< endl;
}
}
}
int
gsl_linalg_complex_LU_solve (const gsl_matrix_complex * LU, const gsl_permutation * p, const gsl_vector_complex * b, gsl_vector_complex * x)
{
if (LU->size1 != LU->size2)
{
GSL_ERROR ("LU matrix must be square", GSL_ENOTSQR);
}
else if (LU->size1 != p->size)
{
GSL_ERROR ("permutation length must match matrix size", GSL_EBADLEN);
}
else if (LU->size1 != b->size)
{
GSL_ERROR ("matrix size must match b size", GSL_EBADLEN);
}
else if (LU->size2 != x->size)
{
GSL_ERROR ("matrix size must match solution size", GSL_EBADLEN);
}
else if (singular (LU))
{
GSL_ERROR ("matrix is singular", GSL_EDOM);
}
else
{
int status;
/* Copy x <- b */
gsl_vector_complex_memcpy (x, b);
/* Solve for x */
status = gsl_linalg_complex_LU_svx (LU, p, x);
return status;
}
}
int
gsl_linalg_complex_LU_svx (const gsl_matrix_complex * LU, const gsl_permutation * p, gsl_vector_complex * x)
{
if (LU->size1 != LU->size2)
{
GSL_ERROR ("LU matrix must be square", GSL_ENOTSQR);
}
else if (LU->size1 != p->size)
{
GSL_ERROR ("permutation length must match matrix size", GSL_EBADLEN);
}
else if (LU->size1 != x->size)
{
GSL_ERROR ("matrix size must match solution/rhs size", GSL_EBADLEN);
}
else if (singular (LU))
{
GSL_ERROR ("matrix is singular", GSL_EDOM);
}
else
{
/* Apply permutation to RHS */
gsl_permute_vector_complex (p, x);
/* Solve for c using forward-substitution, L c = P b */
gsl_blas_ztrsv (CblasLower, CblasNoTrans, CblasUnit, LU, x);
/* Perform back-substitution, U x = c */
gsl_blas_ztrsv (CblasUpper, CblasNoTrans, CblasNonUnit, LU, x);
return GSL_SUCCESS;
}
}
/* monster attempts ranged weapon attack against a square */
void
thrwmq(struct monst *mtmp, int xdef, int ydef)
{
struct obj *otmp, *mwep;
schar skill;
int multishot;
const char *onm;
/* Rearranged beginning so monsters can use polearms not in a line */
if (mtmp->weapon_check == NEED_WEAPON || !MON_WEP(mtmp)) {
mtmp->weapon_check = NEED_RANGED_WEAPON;
/* mon_wield_item resets weapon_check as appropriate */
if (mon_wield_item(mtmp) != 0)
return;
}
/* Pick a weapon */
otmp = select_rwep(mtmp);
if (!otmp)
return;
if (is_pole(otmp)) {
int dam, hitv;
if (otmp != MON_WEP(mtmp))
return; /* polearm must be wielded */
/* TODO: LOE function between two arbitrary points. */
if (dist2(mtmp->mx, mtmp->my, xdef, ydef) > POLE_LIM ||
(xdef == u.ux && ydef == u.uy && !couldsee(mtmp->mx, mtmp->my)))
return; /* Out of range, or intervening wall */
if (mon_visible(mtmp)) {
onm = singular(otmp, xname);
pline("%s thrusts %s.", Monnam(mtmp),
obj_is_pname(otmp) ? the(onm) : an(onm));
}
if (xdef == u.ux && ydef == u.uy) {
dam = dmgval(otmp, &youmonst);
hitv = 3 - distmin(u.ux, u.uy, mtmp->mx, mtmp->my);
if (hitv < -4)
hitv = -4;
if (bigmonst(youmonst.data))
hitv++;
hitv += 8 + otmp->spe;
if (objects[otmp->otyp].oc_class == WEAPON_CLASS ||
objects[otmp->otyp].oc_class == VENOM_CLASS)
hitv += objects[otmp->otyp].oc_hitbon;
if (dam < 1)
dam = 1;
thitu(hitv, dam, otmp, NULL);
action_interrupted();
} else if (MON_AT(level, xdef, ydef))
(void)ohitmon(m_at(level, xdef, ydef), otmp, 0, FALSE);
else if (mon_visible(mtmp))
pline("But it misses wildly.");
return;
}
if (!qlined_up(mtmp, xdef, ydef, FALSE, FALSE) ||
!ai_use_at_range(BOLT_LIM - distmin(mtmp->mx, mtmp->my, xdef, ydef)))
return;
skill = objects[otmp->otyp].oc_skill;
mwep = MON_WEP(mtmp); /* wielded weapon */
/* Multishot calculations */
multishot = 1;
if ((ammo_and_launcher(otmp, mwep) || skill == P_DAGGER || skill == -P_DART
|| skill == -P_SHURIKEN) && !mtmp->mconf) {
/* Assumes lords are skilled, princes are expert */
if (is_prince(mtmp->data))
multishot += 2;
else if (is_lord(mtmp->data))
multishot++;
switch (monsndx(mtmp->data)) {
case PM_RANGER:
multishot++;
break;
case PM_ROGUE:
if (skill == P_DAGGER)
multishot++;
break;
case PM_NINJA:
case PM_SAMURAI:
if (otmp->otyp == YA && mwep && mwep->otyp == YUMI)
multishot++;
break;
default:
break;
}
/* racial bonus */
if ((is_elf(mtmp->data) && otmp->otyp == ELVEN_ARROW && mwep &&
mwep->otyp == ELVEN_BOW) || (is_orc(mtmp->data) &&
otmp->otyp == ORCISH_ARROW && mwep &&
mwep->otyp == ORCISH_BOW))
multishot++;
if ((long)multishot > otmp->quan)
multishot = (int)otmp->quan;
if (multishot < 1)
multishot = 1;
else
multishot = rnd(multishot);
}
if (mon_visible(mtmp)) {
if (multishot > 1) {
/* "N arrows"; multishot > 1 implies otmp->quan > 1, so xname()'s
result will already be pluralized */
onm = msgprintf("%d %s", multishot, xname(otmp));
} else {
/* "an arrow" */
onm = singular(otmp, xname);
onm = obj_is_pname(otmp) ? the(onm) : an(onm);
}
m_shot.s = ammo_and_launcher(otmp, mwep) ? TRUE : FALSE;
pline("%s %s %s!", Monnam(mtmp), m_shot.s ? "shoots" : "throws", onm);
m_shot.o = otmp->otyp;
} else {
m_shot.o = STRANGE_OBJECT; /* don't give multishot feedback */
}
m_shot.n = multishot;
for (m_shot.i = 1; m_shot.i <= m_shot.n; m_shot.i++) {
m_throw(mtmp, mtmp->mx, mtmp->my, sgn(tbx), sgn(tby),
distmin(mtmp->mx, mtmp->my, xdef, ydef), otmp, TRUE);
/* conceptually all N missiles are in flight at once, but
if mtmp gets killed (shot kills adjacent gas spore and
triggers explosion, perhaps), inventory will be dropped
and otmp might go away via merging into another stack;
if we then use it, we could cause undefined behavior */
if (mtmp->mhp <= 0 && m_shot.i < m_shot.n) {
/* cancel pending shots (ought to give a message here since
we gave one above about throwing/shooting N missiles) */
break; /* endmultishot(FALSE); */
}
}
m_shot.n = m_shot.i = 0;
m_shot.o = STRANGE_OBJECT;
m_shot.s = FALSE;
action_interrupted();
}
